| Title: | On minimal forbidden subgraphs for the class of EDM-graphs |
|---|
| Authors: | ID Jaklič, Gašper (Author)
ID Modic, Jolanda (Author) |
|---|
| Files: |  RAZ_Jaklic_Gasper_i2015.pdf (711,65 KB)
MD5: 05131AF49490D4043EAE907394031086
|
|---|
| Language: | English |
|---|
| Work type: | Unknown |
|---|
| Typology: | 1.01 - Original Scientific Article |
|---|
| Organization: | ZUP - University of Primorska Press
|
|---|
| 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 \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. |
|---|
| Keywords: | graph theory, graph, Euclidean distance matrix, distance, eigenvalue |
|---|
| Year of publishing: | 2015 |
|---|
| Number of pages: | str. 151-163 |
|---|
| Numbering: | Vol. 9, no. 2 |
|---|
| PID: | 20.500.12556/RUP-17615  |
|---|
| UDC: | 519.17 |
|---|
| ISSN on article: | 1855-3966 |
|---|
| COBISS.SI-ID: | 17219417 |
|---|
| Publication date in RUP: | 31.12.2021 |
|---|
| Views: | 937 |
|---|
| Downloads: | 20 |
|---|
| Metadata: |     |
|---|
|
:
|
Copy citation |
|---|
| | | | Average score: | (0 votes) |
|---|
| Your score: | Voting is allowed only for logged in users. |
|---|
| Share: |  |
|---|
Hover the mouse pointer over a document title to show the abstract or click
on the title to get all document metadata. |
