Algebraic Connectivity of Connected Graphs with Fixed Number of Pendant Vertices

Please use this identifier to cite or link to this item: http://idr.niser.ac.in:8080/jspui/handle/123456789/950

Full metadata record

DC Field	Value	Language
dc.contributor.author	Patra, Kamal Lochan	-
dc.contributor.author	Sahoo, Binod Kumar	-
dc.date.accessioned	2024-11-20T10:21:51Z	-
dc.date.available	2024-11-20T10:21:51Z	-
dc.date.issued	2010-08-21	-
dc.identifier.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.	en_US
dc.identifier.uri	https://doi.org/10.1007/s00373-010-0975-0	-
dc.identifier.uri	http://idr.niser.ac.in:8080/jspui/handle/123456789/950	-
dc.description.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.	en_US
dc.language.iso	en	en_US
dc.publisher	Graphs and Combinatorics	en_US
dc.subject	Laplacian matrix	en_US
dc.subject	Algebraic connectivity	en_US
dc.subject	Characteristic set	en_US
dc.subject	Perron component	en_US
dc.subject	Pendant vertex	en_US
dc.title	Algebraic Connectivity of Connected Graphs with Fixed Number of Pendant Vertices	en_US
dc.type	Article	en_US
Appears in Collections:	Journal Papers

Files in This Item:

There are no files associated with this item.