论文标题
通过图1的图实现距离矩阵
Realization of distance matrices by graphs of genus 1
论文作者
论文摘要
在距离矩阵$ d $的情况下，我们研究了其压实向量的行为和减少矩阵的行为，以通过加权图实现$ d $的问题。为此，我们首先通过$ n- $循环给出了一般的实现结果，然后依次将重点放在属1的图表上，提出了一种算法，该算法确定何时可以通过这种图形实现距离矩阵，然后显示如何构造它。
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.
