Distance ideals of graphs
classification
🧮 math.CO
keywords
distancegraphsidealsclassificationconceptformgeneralizationgraph
read the original abstract
We introduce the concept of distance ideals of graphs, which can be regarded as a generalization of the Smith normal form and the spectra of the distance matrix of a graph. We obtain a classification of the graphs with at most one trivial distance ideal.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.