Abstract
A graph is Laplacian integral if the spectrum of its Laplacian matrix consists of integers. We define and characterize the integrally completable graphs—those Laplacian integral graphs with the property that one can add in a sequence of edges, preserve Laplacian integrality with each addition, and continue the process until the complete graph has been constructed. We then discuss the integrally completable graphs with the property that the deletion of any edge yields a graph that is not integrally completable, and the graphs G having the property that for any graph H on the same number of vertices having G as a subgraph, H is necessarily Laplacian integral. Finally, we characterize the integrally completable graphs having distinct eigenvalues.
Sign-in/Register to access full text options 
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.
