Realization of distance matrices by unicyclic graphs

MaRDI QIDQ5039602zbMATH OpenFDO

Authors Cristano Bocci, Chiara Capresi

Publication date 30 September 2022

Full work available at URL https://arxiv.org/abs/2012.07698, http://www.seminariomatematico.polito.it/rendiconti/79-2/Bocci_Capresi.pdf

zbMATH Keywords

compaction vectorreduction matrix

Mathematics Subject Classification ID

Distance in graphs (05C12) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

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 graphs of genus 1, presenting an algorithm which determines when a distance matrix is realizable by such a kind of graph, and then, shows how to construct it.

Recommendations

• scientific article; zbMATH DE number 915266
• A constructive algorithm for realizing a distance matrix
• An algorithm and its role in the study of optimal graph realizations of distance matrices
• The distance eigenvalues of the complements of unicyclic graphs
• On Euclidean distance matrices of graphs

Cited in

(1)

• scientific article; zbMATH DE number 915266 (Why is no real title available?)

This page was built for publication: Realization of distance matrices by unicyclic graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5039602)