On regular graphs equienergetic with their complements
Ricardo A. Podest\'a, Denis E. Videla

TL;DR
This paper characterizes when regular graphs are equienergetic with their complements, providing classifications for various graph families including cubic, bipartite, strongly regular, and certain Cayley graphs, revealing new structural insights.
Contribution
It offers necessary and sufficient conditions for regular graphs to be equienergetic with their complements, including classifications for specific graph families and new characterizations within Cameron's hierarchy.
Findings
Classified connected cubic graphs with loops and without loops that are equienergetic with their complements.
Identified that bipartite regular graphs equienergetic with their complements are crown graphs or C4.
Characterized strongly regular graphs that are equienergetic with their complements, including conference and pseudo Latin square graphs.
Abstract
We give necessary and sufficient conditions on the parameters of a regular graph (with or without loops) such that . We study complementary equienergetic cubic graphs obtaining classifications up to isomorphisms for connected cubic graphs with single loops (5 non-isospectral pairs) and connected integral cubic graphs without loops ( or ). Then we show that, up to complements, the only bipartite regular graphs equienergetic and non-isospectral with their complements are the crown graphs or . Next, for the family of strongly regular graphs we characterize all possible parameters such that . Furthermore, using this, we prove that a strongly regular graph is equienergetic to its complement if and only if it is either a conference graph or else it is a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
