ELEMENTARY PROOFS OF THE DIAMETER BOUNDS FOR POWER GRAPHS

被引：0

作者：

Barbieri, Marco ^{[1
]}

Rekvenyi, Kamilla ^{[2
,3
]}

机构：

[1] Univ Pavia, Dipartimento Matemat Felice Casorati, Via Ferrata 5, I-27100 Pavia, Italy

[2] Univ Manchester, Dept Math, Manchester M13 9PL, England

[3] Heilbronn Inst Math Res, Bristol BS8 1UG, England

来源：

BULLETIN OF THE AUSTRALIAN MATHEMATICAL SOCIETY | 2025年

关键词：

power graph; enhanced power graph; connected; diameter;

D O I：

10.1017/S0004972724001382

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

We give a simplified version of the proofs that, outside of their isolated vertices, the complement of the enhanced power graph and of the power graph are connected and have diameter at most $3$ .

引用

页数：4

共 50 条

[21] The diameter of power graphs of symmetric groups
Pourghobadi, Kobra
Jafari, Sayyed Heidar
JOURNAL OF ALGEBRA AND ITS APPLICATIONS, 2018, 17 (12)
[22] On the power of BFS to determine a graphs diameter
Corneil, DG
Dragan, FF
Köhler, E
LATIN 2002: THEORETICAL INFORMATICS, 2002, 2286 : 209 - 223
[23] UPPER-BOUNDS FOR THE DIAMETER AND HEIGHT OF GRAPHS OF CONVEX POLYHEDRA
KALAI, G
DISCRETE & COMPUTATIONAL GEOMETRY, 1992, 8 (04) : 363 - 372
[24] ON UPPER-BOUNDS IN TREE-DIAMETER SETS OF GRAPHS
SHIBATA, Y
FUKUE, S
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS, 1989, 36 (06): : 905 - 907
[25] Tight Conditional Lower Bounds for Approximating Diameter in Directed Graphs
Dalirrooyfard, Mina
Wein, Nicole
STOC '21: PROCEEDINGS OF THE 53RD ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING, 2021, : 1697 - 1710
[26] Bounds on the Order of 4-Critical Graphs with Diameter Two
van der Merwe, Lucas
Loizeaux, Marc
UTILITAS MATHEMATICA, 2009, 78 : 107 - 119
[27] Geometry and diameter bounds of directed Cayley graphs of Abelian groups
Fiduccia, CM
Forcade, RW
Zito, JS
SIAM JOURNAL ON DISCRETE MATHEMATICS, 1998, 11 (01) : 157 - 167
[28] Proofs with graphs
Curtis, S
Lowe, G
SCIENCE OF COMPUTER PROGRAMMING, 1996, 26 (1-3) : 197 - 216
[29] Diameter bounds and recursive properties of Full-Flag Johnson graphs
Dai, Irving
DISCRETE MATHEMATICS, 2018, 341 (07) : 1932 - 1944
[30] Sharp upper bounds for Zagreb indices of bipartite graphs with a given diameter
Faculty of Mathematics and Statistics, Central China Normal University, Wuhan 430079, China
不详
Appl Math Lett, 2 (131-137):

← 1 2 3 4 5 →