| 强乘积图的最小强半径（英文） |
| |
| 作者姓名： | 刘树洋 李峰 |
| |
| 作者单位： | 1. College of Computer Science, Qinghai Normal University;2. The State Key Laboratory of Tibetan Intelligent Information Processing and Application |
| |
| 基金项目： | Supported by National Natural Science Foundation of China (Grant No. 11551002)；;Natural Science Foundation of Qinghai Province (Grant No. 2019-ZJ-7093)； |
| |
| 摘 要： | 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.
|
|
|
