Skip to main content
SpringerLink
Log in

Algebraic Connectivity of Connected Graphs with Fixed Number of Pendant Vertices

  • Original Paper
  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Bapat R.B., Pati S.: Algebraic connectivity and the characteristic set of a graph. Linear Multilinear Algebra 45, 247–273 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  2. Fallat S., Kirkland S.: Extremizing algebraic connectivity subject to graph-theoretic constraints. Electron. J. Linear Algebra 3, 48–74 (1998)

    MATH  MathSciNet  Google Scholar 

  3. Fallat S.M., Kirkland S., Pati S.: Minimizing algebraic connectivity over connected graphs with fixed girth. Discret. Math. 254, 115–142 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  4. Fallat S.M., Kirkland S., Pati S.: Maximizing algebraic connectivity over unicyclic graphs. Linear Multilinear Algebra 51, 221–241 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  5. Fiedler M.: Algebraic connectivity of graphs. Czechoslov. Math. J. 23(98), 298–305 (1973)

    MathSciNet  Google Scholar 

  6. 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

  7. Grone R., Merris R.: Algebraic connectivity of trees. Czechoslov. Math. J. 37(112), 660–670 (1987)

    MathSciNet  Google Scholar 

  8. Grone R., Merris R., Sunder V.S.: The Laplacian spectrum of a graph. SIAM J. Matrix Anal. Appl. 11, 218–238 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  9. Guo J.-M.: A conjecture on the algebraic connectivity of connected graphs with fixed girth. Discret. Math. 308, 5702–5711 (2008)

    Article  MATH  Google Scholar 

  10. Harary F.: Graph Theory. Addison-Wesley, Reading (1969)

    Google Scholar 

  11. Kirkland S., Fallat S.: Perron components and algebraic connectivity for weighted graphs. Linear Multilinear Algebra 44, 131–148 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  12. Kirkland S., Neumann M., Shader B.L.: Characteristic vertices of weighted trees via Perron values. Linear Multilinear Algebra 40, 311–325 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  13. Merris R.: Characteristic vertices of trees. Linear Multilinear Algebra 22, 115–131 (1987)

    Article  MathSciNet  Google Scholar 

  14. 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)

  15. 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

  16. Minc H.: Nonnegative Matrices. Wiley, New York (1988)

    MATH  Google Scholar 

  17. Patra K.L.: Maximizing the distance between center, centroid and characteristic set of a tree. Linear Multilinear Algebra 55, 381–397 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  18. 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)

    Article  MATH  MathSciNet  Google Scholar 

  19. 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)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Statistics, Indian Institute of Technology Kanpur, Kanpur, 208016, India

    Arbind Kumar Lal

  2. School of Mathematical Sciences, National Institute of Science Education and Research, Bhubaneswar, 751005, India

    Kamal Lochan Patra & Binod Kumar Sahoo

Authors
  1. Arbind Kumar Lal
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kamal Lochan Patra
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Binod Kumar Sahoo
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Arbind Kumar Lal.

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

Reprints 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

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-010-0975-0

Keywords

Mathematics Subject Classification (2000)

Search

Navigation