More on Equienergetic Threshold Graphs
Combinatorics
2018-07-03 v1
Abstract
The energy of a graph is defined as the sum the absolute values of the eigenvalues of its adjacency matrix. A threshold graph G on n vertices is coded by a binary sequence of length n. In this paper we answer a question posed by Jacobs et al. [Eigenvalues and energy in threshold graphs, Linear Algebra Appl. 465 (2015) 412-425], by giving an infinite sequences of threshold graphs having the same energy but differ to the complete graph's energy.
Keywords
Cite
@article{arxiv.1807.00627,
title = {More on Equienergetic Threshold Graphs},
author = {Fernando Tura},
journal= {arXiv preprint arXiv:1807.00627},
year = {2018}
}
Comments
7 pages, 1 figure