On the normalized spectrum of threshold graphs

From MaRDI portal
Publication:2013192

DOI10.1016/J.LAA.2017.05.007zbMATH Open1367.05124arXiv1610.08816OpenAlexW2542599805MaRDI QIDQ2013192FDOQ2013192


Authors: Anirban Banerjee, Ranjit Mehatari Edit this on Wikidata


Publication date: 3 August 2017

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1610.08816




Recommendations




Cites Work


Cited In (8)





This page was built for publication: On the normalized spectrum of threshold graphs

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