On tricyclic graphs of a given diameter with minimal energy

DOI10.1016/j.laa.2008.08.004zbMath1168.05325OpenAlexW2019432192MaRDI QIDQ958030

Shuchao Li, Xue-Chao Li

Publication date: 2 December 2008

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2008.08.004

zbMATH Keywords

energyeigenvaluegraphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (10)

On the lower and upper bounds for different indices of tricyclic graphs ⋮ Results on energies for trees with a given diameter having perfect matching ⋮ On the spectral radius of tricyclic graphs with a maximum matching ⋮ On tricyclic graphs whose second largest eigenvalue does not exceed 1 ⋮ On the tree with diameter 4 and maximal energy ⋮ On the spectral radius and energy of the weighted adjacency matrix of a graph ⋮ On the coefficients of the independence polynomial of graphs ⋮ Spectral conditions for graphs to be \(k\)-Hamiltonian or \(k\)-path-coverable ⋮ On the spectral radius of tricyclic graphs with a fixed diameter ⋮ Some properties of comaximal right ideal graph of a ring

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the minimal energy of trees with a given diameter
• Unicyclic graphs with given number of pendent vertices and minimal energy
• On bicyclic graphs with maximal energy
• On bicyclic graphs with minimal energies
• On minimal energies of trees of a prescribed diameter

This page was built for publication: On tricyclic graphs of a given diameter with minimal energy