A new method of comparing the energies of subdivision bipartite graphs

zbMATH Open1289.05312MaRDI QIDQ2856750FDOQ2856750

Authors: Li Zhang, Hai-Ying Shan, Jia-Yu Shao, Changxiang He 

Publication date: 30 October 2013

Published in: MATCH - Communications in Mathematical and in Computer Chemistry (Search for Journal in Brave)

Recommendations

• The proof of a conjecture on the comparison of the energies of trees
• Bipartite unicyclic graphs with large energies
• Two subgraph grafting theorems on the energy of bipartite graphs
• scientific article; zbMATH DE number 3855155
• scientific article; zbMATH DE number 7414712

Mathematics Subject Classification ID

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

Cited In (8)

• The proof of a conjecture on the comparison of the energies of trees
• A sharp upper bound on the incidence energy of graphs in terms of connectivity
• On line graphs with maximum energy
• Maximal energy of subdivisions of graphs with a fixed chromatic number
• Bipartite unicyclic graphs with large energies
• Two subgraph grafting theorems on the energy of bipartite graphs
• Unicyclic signed graphs with the first \(\lfloor \frac{ n + 1}{ 2} \rfloor\) largest energies
• On the minimal matching energies of unicyclic graphs

This page was built for publication: A new method of comparing the energies of subdivision bipartite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2856750)