Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4602194 | Linear Algebra and its Applications | 2009 | 16 Pages |
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,d) be the class of tricyclic graphs G on n vertices with diameter d and containing no vertex disjoint odd cycles Cp,Cq of lengths p and q with p+q≡2(mod4). In this paper, we characterize the graphs with minimal energy in G(n,d).
Related Topics
Physical Sciences and Engineering
Mathematics
Algebra and Number Theory