Abstract

We extend the means by which a regular graph can sometimes be identified from a star complement. In two applications we determine (i) the regular graphs with a path as a star complement for the eigenvalue 1, (ii) the extremal regular graphs which have another type of tree as a star complement for an eigenvalue ≠−1,0.

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 call

Disclaimer: 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.