Regular graphs with maximal energy per vertex

From MaRDI portal
Publication:403366

DOI10.1016/J.JCTB.2014.02.007zbMATH Open1298.05217arXiv1210.8273OpenAlexW2462114844MaRDI QIDQ403366FDOQ403366


Authors: Willem H. Haemers, Jack H. Koolen, Edwin R. Van Dam Edit this on Wikidata


Publication date: 29 August 2014

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1210.8273




Recommendations




Cites Work


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)