Minimum Strong Radius of Strong Product Graphs

LIU Shu-yang, LI Feng

doi:10.13371/j.cnki.chin.q.j.m.2024.01.006

Chinese Quarterly Journal of Mathematics >

2024 , Vol. 39 >Issue 1: 68 - 72

DOI: https://doi.org/10.13371/j.cnki.chin.q.j.m.2024.01.006

Minimum Strong Radius of Strong Product Graphs

Expand

1. College of Computer Science, Qinghai Normal University, Xining 810000, China; 2. The State Key Laboratory of Tibetan Intelligent Information Processing and Application, Xining 810000, China

LIU Shu-yang (1997-), male, native of Fuzhou, Jiangxi, postgraduate student of Qinghai Normal University, engages in graph theory; LI Feng (1980-), male, native of Wuhu, Anhui, professor of Qinghai Normal University, Ph.D, engages in graph theory.

Received date: 2022-09-05

Online published: 2024-03-30

Supported by

Supported by National Natural Science Foundation of China (Grant No. 11551002); Natural
Science Foundation of Qinghai Province (Grant No. 2019-ZJ-7093).

Fold

Abstract

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.

Key words： Strong product graph; Factor graph; Minimum strong radius

Cite this article

LIU Shu-yang, LI Feng . Minimum Strong Radius of Strong Product Graphs[J]. Chinese Quarterly Journal of Mathematics, 2024 , 39(1) : 68 -72 . DOI: 10.13371/j.cnki.chin.q.j.m.2024.01.006

Options

Outlines

模态框（Modal）标题

Abstract

Cite this article