Open AccessQ-borderenergetic threshold graphs
Author(s) -
João Roberto Lazzarin,
Oscar Franscisco Másquez Sosa,
Fernando Tura
Publication year - 2020
Publication title -
ciência e natura
Language(s) - English
Resource type - Journals
eISSN - 2179-460X
pISSN - 0100-8307
DOI - 10.5902/2179460x39755
Subject(s) - combinatorics , mathematics , graph , discrete mathematics
A graph G is said to be borderenergetic (L-borderenergetic, respectively) if its energy (Laplacian energy, respectively) equals the energy (Laplacian energy, respectively) of the complete graph. Recently, this concept was extend to signless Laplacian energy (see Tao, Q., Hou, Y. (2018). Q-borderenergetic graphs. AKCE International Journal of Graphs and Combinatorics). A graph G is called Q-borderenergetic if its signless Laplacian energy is the same of the complete graph Kn; i.e., QE(G) = QE(Kn) = 2n - 2: In this paper, we investigate Q-borderenergetic graphs on the class of threshold graphs. For a family of threshold graphs of order n = 100; we find out exactly 13 graphs such that QE(G) = 2n- 2: