Abstract
It is well known that the Interlacing theorem for the Laplacian spectrum of a finite graph and its induced sub graphs is not true in a general case. In this paper we completely describe all simple finite graphs for which this theorem is true. Besides, we prove a variant of the Interlacing theorem for Laplacian spectrum and induced sub graphs of a graph which is true in general case.
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.
