Advertisement

Journal of Combinatorial Optimization

, Volume 39, Issue 2, pp 589–601 | Cite as

On alternating paths and the smallest positive eigenvalue of trees

  • Sonu RaniEmail author
  • Sasmita Barik
Article

Abstract

In this article, we consider the class of tress on a fixed number of vertices. We consider the problem of finding trees with first four minimum smallest positive eigenvalues. First we obtain the upper and lower bounds on number of alternating paths in a tree. It is shown that the smallest positive eigenvalue of a tree is related to the number of alternating paths in it. With the help of combinatorial arguments, the trees with the maximum, second maximum and third maximum number of alternating paths are derived. Subsequently, the unique trees with the second minimum, third minimum and fourth minimum smallest positive eigenvalue are characterized.

Keywords

Tree Alternating path Smallest positive eigenvalue Inverse of a tree 

Mathematics Subject Classification

05C30 05C05 05C35 92E10 

Notes

References

  1. Barik S, Neumann M, Pati S (2006) On nonsingular trees and a reciprocal eigenvalue property. Linear Multilinear Algebra 54:453–465MathSciNetCrossRefGoogle Scholar
  2. Buckley F, Doty LL, Harary F (1988) On graphs with signed inverses. Networks 18:151–157MathSciNetCrossRefGoogle Scholar
  3. Coulson CA, O’Leary B, Mallion RB (1978) Huckel theory for organic chemists. Academic Press, LondonGoogle Scholar
  4. Cvetković D, Doob M, Sachs H (1980) Spectra of graphs-theory and applications. Academic Press, New YorkzbMATHGoogle Scholar
  5. Dias JR (1993) Molecular orbital calculations using chemical graph theory. Springer, BerlinCrossRefGoogle Scholar
  6. Frucht R, Harary F (1970) On the corona of two graphs. Aequ Math 4:322–325MathSciNetCrossRefGoogle Scholar
  7. Godsil CD (1985) Inverses of trees. Combinatorica 5(1):33–39MathSciNetCrossRefGoogle Scholar
  8. Graovac A, Gutman I (1980) Estimation of the HOMO–LUMO separation. Croat Chem Acta 53:45–50Google Scholar
  9. Graovac A, Gutman I, Trinajstić N (1977) Topological approach to the chemistry of conjugated molecules. Springer, BerlinCrossRefGoogle Scholar
  10. Gutman I (1978) Total \(\pi \)-electron energy and molecular topology. Bibliography. MATCH Commun Math Comput Chem 4:195–200Google Scholar
  11. Gutman I (1992) Total \(\pi \)-electron energy of benzenoid hydrocarbons. Top Curr Chem 162:29–63CrossRefGoogle Scholar
  12. Gutman I (2005) Topology and stability of conjugated hydrocarbons. The dependence of total \(\pi \)-electron energy on molecular topology. J Serb Chem Soc 70:441–456CrossRefGoogle Scholar
  13. Gutman I, Polansky OE (1986) Mathematical concepts in organic chemistry. Springer, BerlinCrossRefGoogle Scholar
  14. Gutman I, Rouvray D (1979) An approximate topological formula for the HOMO–LUMO separation in alternant hydrocarbons. Chem Phys Lett 62:384–388CrossRefGoogle Scholar
  15. Hall GG (1977) On the eigenvalues of molecular graphs. Mol Phys 33:551–557CrossRefGoogle Scholar
  16. Harary F (1969) Graph theory. Addison-Wesley Publishing Company, BostonCrossRefGoogle Scholar
  17. Hong Y (1989) Sharp lower bounds on the eigenvalues of trees. Linear Algebra Appl 113:101–105MathSciNetCrossRefGoogle Scholar
  18. Li X, Li Y, Shi Y, Gutman I (2013) Note on the HOMO–LUMO index of graphs. MATCH Commun Math Comput Chem 70:85–96MathSciNetzbMATHGoogle Scholar
  19. Pavlikova S, Krc-jediny J (1990) On the inverse and dual index of a tree. Linear Multilinear Algebra 28:93–109MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2019

Authors and Affiliations

  1. 1.School of Basic SciencesIndian Institute of Technology, BhubaneswarBhubaneswarIndia

Personalised recommendations