On minimal forbidden subgraphs for the class of EDM-graphsJaklič, Gašper (Avtor) Modic, Jolanda (Avtor) graph theorygraphEuclidean distance matrixdistanceeigenvalueIn 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 \le 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.20152021-12-31 00:54:56Neznano17615UDK: 519.17ISSN pri članku: 1855-3966COBISS.SI-ID: 17219417sl