On minimal forbidden subgraphs for the class of EDM-graphs
Jaklič, Gašper ; Modic, Jolanda
ARS MATHEMATICA CONTEMPORANEA, Tome 9 (2014), / Harvested from ARS MATHEMATICA CONTEMPORANEA
link
link
link

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.

Publié le : 2014-01-01
DOI : https://doi.org/10.26493/1855-3974.467.98f 
@article{467,
     title = {On minimal forbidden subgraphs for the class of EDM-graphs},
     journal = {ARS MATHEMATICA CONTEMPORANEA},
     volume = {9},
     year = {2014},
     doi = {10.26493/1855-3974.467.98f},
     language = {EN},
     url = {http://dml.mathdoc.fr/item/467}
}

Jaklič, Gašper; Modic, Jolanda. On minimal forbidden subgraphs for the class of EDM-graphs. ARS MATHEMATICA CONTEMPORANEA, Tome 9 (2014) . doi : 10.26493/1855-3974.467.98f. http://gdmltest.u-ga.fr/item/467/