Abstract
Assuming a uniform random model of selecting creation sequences, we show that almost every connected threshold graph has more negative than positive eigenvalues. We show that no threshold graphs have eigenvalues in (−1,0). Sequences of equienergetic graphs are given including the striking result that for all n≥3, there exist n−1 threshold graphs of order n2, pairwise noncospectral, each equienergetic to Kn2. For all n>8, we find an n-vertex hyperenergetic threshold graph.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
