On distance matrices of distance-regular graphs
Hui Zhou, Rongquan Feng
TL;DR
This paper characterizes when the distance matrices of distance-regular graphs are invertible, providing insights into their algebraic properties and potential applications in graph theory.
Contribution
It offers a new characterization of the invertibility of distance matrices specifically for distance-regular graphs.
Findings
Identifies conditions for invertibility of distance matrices
Provides a theoretical framework for analyzing distance-regular graphs
Enhances understanding of algebraic properties of these graphs
Abstract
In this paper, we give a characterization of distance matrices of distance-regular graphs to be invertible.
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
TopicsFinite Group Theory Research · graph theory and CDMA systems · Graph theory and applications