On the construction of l-equienergetic graphs

Abstract

For a graph with n vertices and m edges, having Laplacian spectrum μ1, μ2, ·s,μn and signless Laplacian spectrum μ+1,μ+2, ·s,μ+n, the Laplacian energy and signless Laplacian energy of G are respectively, defined as LE(G)=Σi=1n|μi-2mn| and LE+(G)=Σi=1n|μ+i-2mn|. Two graphs G1 and G2 of same order are said to be L-equienergetic if LE(G1)=LE(G2) and Q-equienergetic if LE+(G1)=LE+(G2). The problem of constructing graphs having same Laplacian energy has been considered by Stevanovic for threshold graphs and by Liu and Liu for those graphs whose order is n 0 (mod 7). In general the problem of constructing L-equienergetic graphs from any pair of given graphs is still not solved, and this work is an attempt in that direction. We construct sequences of non-cospectral (Laplacian, signless Laplacian) L-equienergetic and Q-equienergetic graphs from any pair of graphs having same number of vertices and edges.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…