A sharp upper bound on the incidence energy of graphs in terms of connectivity
From MaRDI portal
Recommendations
Cites work
- A new method of comparing the energies of subdivision bipartite graphs
- A survey on the Laplacian-energy-like invariant
- Eigenvalue bounds for the signless laplacian
- Energy of line graphs
- Graph energy
- scientific article; zbMATH DE number 1618184 (Why is no real title available?)
- scientific article; zbMATH DE number 5259335 (Why is no real title available?)
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- Incidence energy of a graph
- Integral circulant graphs of prime power order with maximal energy
- Laplacian energy of a graph
- On incidence energy of a graph
- On incidence energy of graphs
- Seidel switching and graph energy
- Signless Laplacians of finite graphs
- Strongly regular graphs with maximal energy
- The energy of random graphs
- The Laplacian-energy like of graphs
- Towards a spectral theory of graphs based on the signless Laplacian. I
- Unicyclic bipartite graphs with maximum energy
Cited in
(8)- On line graphs with maximum energy
- Asymptotic incidence energy of lattices
- Distance matrices on the \textit{H-join} of graphs: a general result and applications
- On the spectrum of an equitable quotient matrix and its application
- Extremal graphs for Estrada indices
- On incidence energy of graphs
- A unified approach to the asymptotic topological indices of various lattices
- On energies of graphs with given independence number and families of hyperenergetic graphs
This page was built for publication: A sharp upper bound on the incidence energy of graphs in terms of connectivity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1931756)
