On distance integral and distance Laplacian integral graphs
S. Pirzada, Ummer Mushtaq, Leonardo de Lima

TL;DR
This paper investigates conditions under which certain classes of graphs are distance integral or distance Laplacian integral, focusing on specific graph constructions and their eigenvalue properties.
Contribution
It provides new criteria for the distance and distance Laplacian integrality of complex graph families like joins and dumbbell graphs.
Findings
Conditions for $aar{K}_m abla C_n$ to be distance integral.
Conditions for $K_{p,p} abla C_n$ to be distance integral.
Criteria for $oldsymbol{DB}(W_{m,n})$ to be $D^L$-integral.
Abstract
Let be a connected graph on vertices and let and be the distance and the distance Laplacian matrices associated with . A graph is said to be -integral (resp. -integral) if all eigenvalues of (resp. ) are integers. In this paper, we obtain various conditions under which the graphs and are distance integral. We also obtain conditions on , under which the dumbbell graph is -integral.
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 · Limits and Structures in Graph Theory · Graph Labeling and Dimension Problems
