On minimal forbidden subgraphs for the class of EDM-graphs
DOI:
https://doi.org/10.26493/1855-3974.467.98fKeywords:
Graph, Euclidean distance matrix, distance, eigenvalue.Abstract
In this paper, a relation between graph distance matrices and Euclidean distance matrices (EDM) is considered. Graphs, for which the distance matrix is not an EDM (NEDM-graphs), are studied. All simple connected non-isomorphic graphs on n <= 8 nodes are analysed and a characterization of the smallest NEDM-graphs, i.e., the minimal forbidden subgraphs, is given. It is proven that bipartite graphs and some subdivisions of the smallest NEDM-graphs are NEDM-graphs, too.Downloads
Published
2014-11-16
Issue
Section
Articles
License
Articles in this journal are published under Creative Commons Attribution 4.0 International License
https://creativecommons.org/licenses/by/4.0/