摘要:
A strong product graph is denoted by G1 ⊠G2, where G1 and G2 are called
its factor graphs. This paper gives the range of the minimum strong radius of the strong
product graph. And using the relationship between the cartesian product graph G1 ×G2
and the strong product graph G1 ⊠G2, another different upper bound of the minimum
strong radius of the strong product graph is given.
中图分类号:
刘树洋, 李峰. 强乘积图的最小强半径[J]. 数学季刊, 2024, 39(1): 68-72.
LIU Shu-yang, LI Feng. Minimum Strong Radius of Strong Product Graphs[J]. Chinese Quarterly Journal of Mathematics, 2024, 39(1): 68-72.