论文标题
在签名图中的签名距离上
On Signed Distance in Product of Signed Graphs
论文作者
论文摘要
签名的图是一个图形，每个边缘具有正符号或负符号。在本文中，首先，我们表征了连接的签名图的距离兼容性，并讨论了笛卡尔产品，词典产物和签名图的张量产品的距离兼容性标准。我们还根据因子图的距离矩阵来处理笛卡尔产品，词典产物和张量产物的距离矩阵。
A signed graph is a graph in which each edge has a positive or negative sign. In this article, first we characterize the distance compatibility in the case of a connected signed graph and discussed the distance compatibility criterion for the cartesian product, lexicographic product and tensor product of signed graphs. We also deal with the distance matrix of the cartesian product, lexicographic product and tensor product of signed graphs in terms of the distance matrix of the factor graphs.
