An edge grafting theorem on the energy of unicyclic and bipartite graphs

DOI10.1016/J.LAA.2010.03.019zbMath1216.05078OpenAlexW2023331019MaRDI QIDQ977469

J. Martínez

Publication date: 22 June 2010

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

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

zbMATH Keywords

energytreegraphgraftingquasi-ordering

Mathematics Subject Classification ID

Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (8)

Ordering of minimal energies in unicyclic signed graphs ⋮ Two new edge grafting operations on the energy of unicyclic graphs and their applications ⋮ Two subgraph grafting theorems on the energy of bipartite graphs ⋮ On the Estrada and Laplacian Estrada indices of graphs ⋮ Some relations on the ordering of trees by minimal energies between subclasses of trees ⋮ On the minimal energy of conjugated unicyclic graphs with maximum degree at most 3 ⋮ Bipartite unicyclic graphs with large energies ⋮ On the minimal energy of graphs

Cites Work

• Unicyclic graphs with maximal energy
• Unicyclic graphs with minimal energy
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An edge grafting theorem on the energy of unicyclic and bipartite graphs