On the normalized spectrum of threshold graphs
Combinatorics
2017-05-08 v2
Abstract
In this article we investigate normalized adjacency eigenvalues (simply normalized eigenvalues) and normalized adjacency energy of connected threshold graphs. A threshold graph can always be represented as a unique binary string. Certain eigenvalues are obtained directly from its binary representation and the rest of the eigenvalues are evaluated from its normalized equitable partition matrix. Finally, we characterize threshold graphs with at most five distinct eigenvalues.
Cite
@article{arxiv.1610.08816,
title = {On the normalized spectrum of threshold graphs},
author = {Anirban Banerjee and Ranjit Mehatari},
journal= {arXiv preprint arXiv:1610.08816},
year = {2017}
}
Comments
16 pages, 3 figures, final version will appear in Linear Algebra and its Application