Abstract
We prove that for every tree T with t vertices (t>2), the signed line graph L(Kt) has L(T) as a star complement for the eigenvalue −2; in other words, T is a foundation for Kt (regarded as a signed graph with all edges positive). In fact, L(Kt) is, to within switching equivalence, the unique maximal signed line graph having such a star complement. It follows that if t∉{7,8,9} then, to within switching equivalence, Kt is the unique maximal signed graph with T as a foundation. We obtain analogous results for a signed unicyclic graph as a foundation, and then provide a classification of signed graphs with spectrum in [−2,∞). We note various consequences, and review cospectrality and strong regularity in signed graphs with least eigenvalue ≥−2.
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.
