Regular graphs with maximal energy per vertex
From MaRDI portal
(Redirected from Publication:403366)
Abstract: We study the energy per vertex in regular graphs. For every k, we give an upper bound for the energy per vertex of a k-regular graph, and show that a graph attains the upper bound if and only if it is the disjoint union of incidence graphs of projective planes of order k-1 or, in case k=2, the disjoint union of triangles and hexagons. For every k, we also construct k-regular subgraphs of incidence graphs of projective planes for which the energy per vertex is close to the upper bound. In this way, we show that this upper bound is asymptotically tight.
Recommendations
Cites work
- scientific article; zbMATH DE number 43547 (Why is no real title available?)
- scientific article; zbMATH DE number 41026 (Why is no real title available?)
- scientific article; zbMATH DE number 3623599 (Why is no real title available?)
- scientific article; zbMATH DE number 2001186 (Why is no real title available?)
- An elliptic semiplane
- An extremal characterization of projective planes
- An extremal characterization of the incidence graphs of projective planes
- Graph energy
- Graphs and matrices with maximal energy
- Maximal energy graphs
- Spectra of graphs
- The difference between consecutive primes. II
Cited in
(6)
This page was built for publication: Regular graphs with maximal energy per vertex
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q403366)