Abstract
Let [Formula: see text] be a tree with [Formula: see text] vertices and [Formula: see text] be its line graph. In this work, we completely characterize the trees for which the algebraic connectivity of [Formula: see text] is equal to [Formula: see text], where × denotes the Kronecker product. We provide a few necessary and sufficient conditions for [Formula: see text] to be Laplacian integral. The algebraic connectivity of [Formula: see text], where [Formula: see text] is a tree of diameter 4 and [Formula: see text]-book graph is discussed.
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.
