Abstract
The energy of a graph is defined as the sum of the absolute values of all the eigenvalues of the graph. Let G(n) be the class of bicyclic graphs G on n vertices and containing no disjoint odd cycles of lengths k and l with k + l ≡ 2 (mod 4). In this paper, the graphs in G(n) with minimal, second-minimal and third-minimal energies are determined.
Similar content being viewed by others
References
I. Gutman O.E. Polansky (1986) Mathematicl Concepts in Organic Chemistry Springer -Verlag Berlin
I. Gutman, in: Algebraic Combinatorics and Applications, eds. A. Betten, A. Kohnert, R. Laue and A. Wassermann (Springer-Verlag, Berlin, 2001), pp. 196–211.
I. Gutman (1977) Theoret. Chim. Acta (Berlin) 45 79–87
F.J. Zhang H. Li (1999) Discrete Appl. Math. 92 71–84
J. Rada A. Tineo (2003) Linear Algebra Appl. 372 333–344
G. Caporossi D. Cvetković I. Gutman P. Hansen (1999) J. Chem. Inf. Comput. Sci. 39 984–996
Y. Hou (2001) J. Math. Chem. 29 163–168
Y. Hou (2001) Linear Multilinear Algebra 49 347–354
D. Cvetkoić M. Doob H. Sachs (1980) Spectra of Graphs–Theory and Applications Academic Press New York
I. Gutman N. Tronajstić (1976) J. Chem. Phys. 64 4921–4925
Author information
Authors and Affiliations
Corresponding author
Additional information
AMS subject classification: 05C50, 05C35
Rights and permissions
About this article
Cite this article
Zhang, J., Zhou, B. On bicyclic graphs with minimal energies. J Math Chem 37, 423–431 (2005). https://doi.org/10.1007/s10910-004-1108-x
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/s10910-004-1108-x