论文标题
距离特征值和两个和三的乘法循环图的转发索引
Distance Eigenvalues and Forwarding Indices of Multiplicative Circulant Graph of Order Power of Two and Three
论文作者
论文摘要
在本文中，我们使用广度优先的搜索算法来确定两个和三个的乘法循环图的距离矩阵。结果，确定了图的直径。我们还给出了它们的距离光谱半径，平均距离以及顶点 - 扭转指数的确切值。最后，使用距离光谱半径和图形转发索引之间的一些已知关系，我们为它们的边缘索引提供了一些界限。
In this paper, we use Breadth-first search algorithm to determine the distance matrix of multiplicative circulant graph of order power of two and three. As a consequence, the diameter of the graphs were determined. We also give their distance spectral radii, average distances, as well as the exact values of vertex-forwarding indices. Finally, using some known relationships between the distance spectral radii and forwarding indices of a graph, we give some bounds for their edge-forwarding indices.
