首页|Minimum Strong Radius of Strong Product Graphs

Minimum Strong Radius of Strong Product Graphs

扫码查看
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.

Strong product graphFactor graphMinimum strong radius

LIU Shu-yang、LI Feng

展开 >

College of Computer Science,Qinghai Normal University,Xining 810000,China

The State Key Laboratory of Tibetan Intelligent Information Processing and Application,Xining 810000,China

国家自然科学基金青海省自然科学基金

115510022019-ZJ-7093

2024

数学季刊(英文版)
河南大学

数学季刊(英文版)

影响因子:0.201
ISSN:1002-0462
年,卷(期):2024.39(1)
  • 18