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.
Similar content being viewed by others
References
Bapat R.B., Pati S.: Algebraic connectivity and the characteristic set of a graph. Linear Multilinear Algebra 45, 247–273 (1998)
Fallat S., Kirkland S.: Extremizing algebraic connectivity subject to graph-theoretic constraints. Electron. J. Linear Algebra 3, 48–74 (1998)
Fallat S.M., Kirkland S., Pati S.: Minimizing algebraic connectivity over connected graphs with fixed girth. Discret. Math. 254, 115–142 (2002)
Fallat S.M., Kirkland S., Pati S.: Maximizing algebraic connectivity over unicyclic graphs. Linear Multilinear Algebra 51, 221–241 (2003)
Fiedler M.: Algebraic connectivity of graphs. Czechoslov. Math. J. 23(98), 298–305 (1973)
Fiedler, M.: Laplacian of graphs and algebraic connectivity, In: Combinatorics and Graph Theory (Warsaw, 1987), pp. 57–70, Banach Center Publ., 25, PWN, Warsaw 1989
Grone R., Merris R.: Algebraic connectivity of trees. Czechoslov. Math. J. 37(112), 660–670 (1987)
Grone R., Merris R., Sunder V.S.: The Laplacian spectrum of a graph. SIAM J. Matrix Anal. Appl. 11, 218–238 (1990)
Guo J.-M.: A conjecture on the algebraic connectivity of connected graphs with fixed girth. Discret. Math. 308, 5702–5711 (2008)
Harary F.: Graph Theory. Addison-Wesley, Reading (1969)
Kirkland S., Fallat S.: Perron components and algebraic connectivity for weighted graphs. Linear Multilinear Algebra 44, 131–148 (1998)
Kirkland S., Neumann M., Shader B.L.: Characteristic vertices of weighted trees via Perron values. Linear Multilinear Algebra 40, 311–325 (1996)
Merris R.: Characteristic vertices of trees. Linear Multilinear Algebra 22, 115–131 (1987)
Merris, R.: Laplacian matrices of graphs: a survey, In: Second Conference of the International Linear Algebra Society (ILAS) Lisbon, 1992 Linear Algebra Appl. 197/198, pp. 143–176 (1994)
Mohar, B.: The Laplacian Spectrum of Graphs, Graph Theory, Combinatorics, and Appllications, vol. 2 (Kalamazoo, MI, 1988), pp. 871–898, Wiley-Intersci. Publ., Wiley, 1991
Minc H.: Nonnegative Matrices. Wiley, New York (1988)
Patra K.L.: Maximizing the distance between center, centroid and characteristic set of a tree. Linear Multilinear Algebra 55, 381–397 (2007)
Patra K.L., Lal A.K.: The effect on the algebraic connectivity of a tree by grafting or collapsing of edges. Linear Algebra Appl. 428, 855–864 (2008)
Shao J.-Y., Guo J.-M., Shan H.-Y.: The ordering of trees and connected graphs by algebraic connectivity. Linear Algebra Appl. 428, 1421–1438 (2008)
Author information
Authors and Affiliations
Corresponding author
Additional information
A. K. Lal takes this opportunity to thank the Department of Science and Technology, New Delhi, India, for the project grant.
Rights and permissions
About this article
Cite this article
Lal, A.K., Patra, K.L. & Sahoo, B.K. Algebraic Connectivity of Connected Graphs with Fixed Number of Pendant Vertices. Graphs and Combinatorics 27, 215–229 (2011). https://doi.org/10.1007/s00373-010-0975-0
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00373-010-0975-0