Algebraic connectivity of Kronecker products of line graphs
Shivani Chauhan, A. Satyanarayana Reddy

TL;DR
This paper characterizes trees whose line graph Kronecker products with complete graphs have specific algebraic connectivity properties, including conditions for Laplacian integrality and special cases involving trees of diameter four.
Contribution
It provides a complete characterization of trees for which the algebraic connectivity of their line graph Kronecker product with K_m equals m-1, and explores Laplacian integrality conditions.
Findings
Characterization of trees with algebraic connectivity of L(X)×K_m equal to m-1.
Necessary and sufficient conditions for Laplacian integrality of L(X)×K_m.
Analysis of algebraic connectivity for trees of diameter 4 and k-book graphs.
Abstract
Let be a tree with vertices and be its line graph. In this work, we completely characterize the trees for which the algebraic connectivity of is equal to , where denotes the Kronecker product. We provide a few necessary and sufficient conditions for to be Laplacian integral. The algebraic connectivity of , where is a tree of diameter and -book graph is discussed.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Synthesis and Properties of Aromatic Compounds · Graphene research and applications
