路与圈直积的直径与容错直径研究
Diameter and Fault-Tolerant Diameter of the Direct Product of Path and Cycle
DOI: 10.12677/pm.2026.161024, PDF,    科研立项经费支持
作者: 马振方, 裴 刚, 谢睿涵*:温州大学数理学院,浙江 温州
关键词: 直积图直径容错直径Path Cycle Direct Product Graph Diameter Fault-Tolerant Diameter
摘要: 本文研究了路径图 P n ,圈图 C m 及其直积图 P n × P m , P n × C m C n × C m 的直径与容错直径,其中 n m 为正整数。对于给定的正整数 k ,通过分析图的结构特性,我们给出了这些图的直径与 k -容错直径的精确表达式,并建立了若干关于直积图中两点间距离的计算公式。特别地,我们证明了 P n × P m 的容错直径等于其直径,而在 P n × C m C n × C m 中,容错直径随图的结构参数变化而呈现出不同特性。本文的结果为图在网络容错性分析与通信延迟建模中的应用提供了理论依据。
Abstract: This paper investigates the diameter and fault-tolerant diameter of path P n , cycle C m , and their direct products P n × P m , P n × C m and C n × C m , where n and m are positive integers. For a given positive integer k , by analyzing the structural properties of these graphs, we derive exact expressions for their diameters and k -fault-tolerant diameters, and establish several formulas for computing distances between two vertices in the direct product graphs. In particular, we prove that the fault-tolerant diameter of P n × P m equals its diameter, while in P n × C m and C n × C m , the fault-tolerant diameter varies with the structural parameters of the graphs. The results of this study provide a theoretical foundation for the application of graphs in network fault-tolerance analysis and communication latency modeling.
文章引用:马振方, 裴刚, 谢睿涵. 路与圈直积的直径与容错直径研究[J]. 理论数学, 2026, 16(1): 213-227. https://doi.org/10.12677/pm.2026.161024

参考文献

[1] Buckley, F. and Lewinter, M. (2003) A Friendly Introduction to Graph Theory. Pearson Education.
[2] Krishnamoorthy, M.S. and Krishnamurthy, B. (1987) Fault Diameter of Interconnection Networks. Computers & Mathematics with Applications, 13, 577-582. [Google Scholar] [CrossRef
[3] Hsu, L.H. and Lin, C.K. (2008) Graph Theory and Interconnection Networks. CRC Press.
[4] Weichsel, P.M. (1962) The Kronecker Product of Graphs. Proceedings of the American Mathematical Society, 13, 47-47-52. [Google Scholar] [CrossRef
[5] Imrich, W. and Klavžar, S. (2000) Product Graphs: Structure and Recognition. John Wiley & Sons.
[6] Shiu, W.C. and Wu, Q. (2013) L(J, K)-Number of Direct Product of Path and Cycle. Acta Mathematica Sinica, English Series, 29, 1437-1448. [Google Scholar] [CrossRef
[7] Xu, J.M. (2001) Topological Structure and Analysis of Interconnection Networks. Springer Science & Business Media.
[8] Wang, J., Yan, Z., et al. (2010) The Laplacian Spectrum of the Direct Product of Path and Cycle. Linear Algebra and Its Applications, 433, 996-1001.
[9] Klavžar, S. and Špacapan, S. (2008) On the Edge-Connectivity of Direct Products of Graphs. Graphs and Combinatorics, 24, 247-250.
[10] Li, X. and Sun, Y. (2015) Rainbow Connection Numbers of Direct Product of Path and Cycle. Ars Combinatoria, 121, 423-432.
[11] Mamut, A. and Vumar, E. (2008) Vertex Connectivity of Direct Product of Graphs. Ars Combinatoria, 86, 33-43.