On the Complementary Equienergetic Graphs

From MaRDI portal
Publication:5159243




Abstract: Energy of a simple graph G, denoted by mathcalE(G), is the sum of the absolute values of the eigenvalues of G. Two graphs with the same order and energy are called equienergetic graphs. A graph G with the property GcongoverlineG is called self-complementary graph, where overlineG denotes the complement of G. Two non-self-complementary equienergetic graphs G1 and G2 satisfying the property G1congoverlineG2 are called complementary equienergetic graphs. Recently, Ramane et al. [Graphs equienergetic with their complements, MATCH Commun. Math. Comput. Chem. 82 (2019) 471-480] initiated the study of the complementary equienergetic regular graphs and they asked to study the complementary equienergetic non-regular graphs. In this paper, by developing some computer codes and by making use of some software like Nauty, Maple and GraphTea, all the complementary equienergetic graphs with at most 10 vertices as well as all the members of the graph class G are determined, where L(G) denotes the line graph of G. In the cases where we could not find the closed forms of the eigenvalues and energies of the obtained graphs, we verify the graph energies using a high precision computing (2000 decimal places) of Maple. A result about a pair of complementary equienergetic graphs is also given at the end of this paper.





Describes a project that uses

Uses Software





This page was built for publication: On the Complementary Equienergetic Graphs

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