Please use this identifier to cite or link to this item:
https://idr.niser.ac.in/jspui/handle/123456789/950| Title: | Algebraic Connectivity of Connected Graphs with Fixed Number of Pendant Vertices |
| Authors: | Patra, Kamal Lochan Sahoo, Binod Kumar |
| Keywords: | Laplacian matrix Algebraic connectivity Characteristic set Perron component Pendant vertex |
| Issue Date: | 21-Aug-2010 |
| Publisher: | Graphs and Combinatorics |
| Citation: | Lal, A. K., Patra, K. L., & Sahoo, B. K. (2011). Algebraic connectivity of connected graphs with fixed number of pendant vertices. Graphs and Combinatorics, 27(2), 215–229. |
| Abstract: | In this paper, we consider the following problem. Over the class of all simple connected graphs of order n with k pendant vertices (n, k being fixed), which graph maximizes (respectively, minimizes) the algebraic connectivity? We also discuss the algebraic connectivity of unicyclic graphs. |
| URI: | https://doi.org/10.1007/s00373-010-0975-0 https://idr.niser.ac.in/jspui/handle/123456789/950 |
| Appears in Collections: | Journal Papers |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.