Abstract
In this paper, we establish the relation between classic invariants and integer Laplacian eigenvalues of strictly chordal graphs, pointing out how their computation can be efficiently implemented. We review results concerning general graphs showing that the number of universal vertices and the degrees of twins provide integer Laplacian eigenvalues and their respective multiplicities. For strictly chordal graphs, we show new results about integer Laplacian eigenvalues which are directly related to particular vertex sets of the 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.
