Skip to main content
SpringerLink
Log in

Some Properties of Algebraic Connectivity

  • Short Communication
  • Published:
National Academy Science Letters Aims and scope Submit manuscript

Abstract

In this paper, we obtain two methods to compare the algebraic connectivity of two graphs, and we also give some graph operations that increase or decrease the algebraic connectivity of a graph.

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

Fig. 1

References

  1. Merris R (1994) Laplacian matrices of graphs: a survey. Linear Algebra Appl 197–198:143–176

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  3. Eichinger BE (1977) An approach to distribution functions for Gaussian molecules. Macromolecules 10:671–675

    Article  ADS  CAS  Google Scholar 

  4. Eichinger BE, Martin JE (1978) Distribution functions for Gaussian molecules. II. Reduction of the Kirchhoff matrix for large molecules. J Chem Phys 69:4595–4599

    Article  ADS  CAS  Google Scholar 

  5. Maas C (1978) Transportation in graphs and the admittance spectrum. Discrete Appl Math 16:31–49

    Article  MathSciNet  Google Scholar 

  6. Horn RA, Johnson CR (1990) Matrix analysis. Cambridge University Press, New York

    MATH  Google Scholar 

  7. Guo JM (2010) The algebraic connectivity of graphs under perturbation. Linear Algebra Appl 433:1148–1153

    Article  MathSciNet  Google Scholar 

  8. Li J, Guo JM, Shiu WC (2010) The smallest values of algebraic connectivity for unicyclic graphs. Discrete Appl Math 158:1633–1643

    Article  MathSciNet  Google Scholar 

  9. Li J, Guo JM, Shiu WC (2012) The smallest values of algebraic connectivity for trees. Acta Math Sin Engl Ser 28:2021–2032

    Article  MathSciNet  Google Scholar 

  10. Shao JY, Guo JM, Shan HY (2008) The ordering of trees and connected graphs by algebraic connectivity. Linear Algebra Appl 428:1421–1438

    Article  MathSciNet  Google Scholar 

  11. Fiedler M (1975) A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory. Czechoslov Math J 25:619–633

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  13. Kirkland S (2000) A bound on the algebraic connectivity of a graph in terms of the number of cutpoints. Linear Multilinear Algebra 47:93–103

    Article  MathSciNet  Google Scholar 

  14. Liu Y, Liu Y (2009) The ordering of unicyclic graphs with the smallest algebraic connectivity. Discrete Math 309:4315–4325

    Article  MathSciNet  Google Scholar 

  15. Shiu W, Guo JM, Li J (2011) The minimum algebraic connectivity of caterpillar unicyclic graphs. Electron J Linear Algebra 22:838–848

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

The authors are grateful to the anonymous referee for helpful suggestions and valuable comments, which led to an improvement in the original manuscript. The authors would like to thank Professor Jianxi Li for giving us some suggestions on the proof of Lemma 3.1. The first author is partially supported by NSFC Project 11571123, the Training Program for Outstanding Young Teachers in University of Guangdong Province (No. YQ2015027), and Guangdong Engineering Research Center for Data Science (No. 2017A-KF02). The third author was supported by the Sungkyun research fund, Sungkyunkwan University, 2017, and National Research Foundation of the Korean government with Grant No. 2017R1D1A1B03028642.

Author information

Authors and Affiliations

  1. Department of Mathematics, South China Agricultural University, Guangzhou, 510642, People’s Republic of China

    Muhuo Liu

  2. College of Mathematics and Statistics, Shenzhen University, Shenzhen, 518060, People’s Republic of China

    Muhuo Liu

  3. School of Mathematics and Systems Science, Guangdong Polytechnic Normal University, Guangzhou, 510665, People’s Republic of China

    Guangliang Zhang

  4. Department of Mathematics, Sungkyunkwan University, Suwon, 16419, Republic of Korea

    Kinkar Chandra Das

Authors
  1. Muhuo Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Guangliang Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Kinkar Chandra Das
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Kinkar Chandra Das.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Liu, M., Zhang, G. & Das, K.C. Some Properties of Algebraic Connectivity. Natl. Acad. Sci. Lett. 43, 537–542 (2020). https://doi.org/10.1007/s40009-020-00909-z

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s40009-020-00909-z

Keywords

Mathematics Subject Classification

Search

Navigation