Given a distance matrix D, we study the behavior of its compaction vector and reduction matrix with respect to the problem of the realization of D by a weighted graph. To this end, we first give a general result on realization by n−cycles and successively we mainly focus on unicyclic graphs, presenting an algorithm which determines when a distance matrix is realizable by such a kind of graph, and then, shows how to construct it.
Bocci, C., Capresi, C. (2021). Realization of distance matrices by unicyclic graphs. RENDICONTI DEL SEMINARIO MATEMATICO, 79(2), 55-76.
Realization of distance matrices by unicyclic graphs
Cristiano Bocci
;
2021-01-01
Abstract
Given a distance matrix D, we study the behavior of its compaction vector and reduction matrix with respect to the problem of the realization of D by a weighted graph. To this end, we first give a general result on realization by n−cycles and successively we mainly focus on unicyclic graphs, presenting an algorithm which determines when a distance matrix is realizable by such a kind of graph, and then, shows how to construct it.
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
Bocci_Capresi.pdf
accesso aperto
Descrizione: articolo
Tipologia:
PDF editoriale
Licenza:
PUBBLICO - Pubblico con Copyright
Dimensione
739.42 kB
Formato
Adobe PDF
|
739.42 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
Utilizza questo identificativo per citare o creare un link a questo documento:
https://hdl.handle.net/11365/1218516