arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2403.07646math.CO
收藏

2-距离图的直径

Diameter of 2-distance graphs

S. H. Jafari, S. R. Musawi

AI总结:

该研究针对2-距离图的直径问题,分别给出直径为2、直径不小于3及直径为3的原图对应的2-距离图直径的取值范围与紧性结论,丰富了图论中2-距离图的直径相关理论。

摘要:

对于简单图$G$,其2-距离图$D_2(G)$是以$V(G)$为顶点集的图,两顶点相邻当且仅当它们在$G$中的距离为2。本文针对直径为2的图$G$,证明$diam(D_2(G))$可以是任意满足$t\geqslant2$的整数。针对$diam(G)\geqslant3$的图$G$,证明$\frac{1}{2}diam(G)\leqslant diam(D_2(G))$且该不等式是紧的。此外,针对$diam(G)=3$的情况,证明$diam(D_2(G))\leqslant5$且该不等式是紧的。

英文摘要:

For a simple graph $G$, the $2$-distance graph, $D_2(G)$, is a graph with the vertex set $V(G)$ and two vertices are adjacent if and only if their distance is $2$ in the graph $G$. In this paper, for graphs $G$ with diameter 2, we show that $diam(D_2(G))$ can be any integer $t\geqslant2$. For graphs $G$ with $diam(G)\geqslant3$, we prove that $\frac{1}{2}diam(G)\leqslant diam(D_2(G))$ and this inequality is sharp. Also, for $diam(G)=3$, we prove that $diam(D_2(G))\leqslant5$ and this inequality is sharp.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑