Energy of a graph is never the square root of an odd integer

DOI10.2298/AADM0801118PMaRDI QIDQ3643774zbMATH OpenFDO

Authors Ivan Gutman, Shariefuddin Pirzada

Publication date 9 November 2009

Published in Applicable Analysis and Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2298/AADM0801118P

zbMATH Keywords

adjacency matrixeigenvaluesenergy of a graph

Mathematics Subject Classification ID

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

Recommendations

• Constructing graphs with energy \(\sqrt{r}E(G)\) where \(G\) is a bipartite graph
• scientific article; zbMATH DE number 1618184
• scientific article; zbMATH DE number 1539552
• Graphs whose energy does not exceed 3
• The energy of a graph

Cited in

(16)

• Energies of unitary one-matching bi-Cayley graphs over finite commutative rings
• Adjacency energy of hypergraphs
• Energy of a semigraph
• Energy of signed digraphs
• Maximum degree and minimum degree spectral radii of some graph operations
• Energies of hypergraphs
• Constructing graphs with energy \(\sqrt{r}E(G)\) where \(G\) is a bipartite graph
• New results on the energy of integral circulant graphs
• RANDIĆ ENERGY OF VARIOUS GRAPHS
• Neighbors Degree Sum Energy of Commuting and Non-Commuting Graphs for Dihedral Groups
• On the various energy forms of the join of complete graphs
• Symmetry and asymmetry between positive and negative square energies of graphs
• On spectrum and energy of non-commuting graph for group \(U_{6n}\)
• On the conjecture of Sombor energy of a graph
• Laplacian and signless Laplacian energies of non-commuting graph for group \(U_{6n}\)
• Distance-based energies of non-commuting graph for dihedral groups

This page was built for publication: Energy of a graph is never the square root of an odd integer

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