ON WIDE DIAMETER OF CAYLEY GRAPHS-Reference-Cited by-同舟云学术

ON WIDE DIAMETER OF CAYLEY GRAPHS

Published:2009-09 Issue:03 Volume:10 Page:219-231
ISSN:0219-2659
Container-title:Journal of Interconnection Networks
language:en
Short-container-title:J. Inter. Net.

Author:

JIA KEVIN E.¹,ZHANG ALICIA Q.²

Affiliation:

1. Department of Mathematics, University of Texas at Austin, Austin, Texas 78712, USA

2. Princeton University, Princeton, New Jersey 08544, USA

Abstract

Because of its applications in network theory, the wide diameter of graphs has been studied extensively in recent years. It is still an open problem to compute the wide diameter of Cayley graphs. This paper investigates the wide diameter of Cayley graphs of ℤm, the cyclic group of residue classes modulo m. It is proved that the k-wide diameter of the Cayley graph Cay (Zm, A) generated by a k-element set A is d + 1 for k = 2 and ≤ d + 1 for k = 3, where d is the diameter of Cay (ℤm, A).

Publisher

World Scientific Pub Co Pte Lt

Subject

Computer Networks and Communications

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0219265909002534

Reference12 articles.

1. Distributed Loop Computer-Networks: A Survey

2. Combinatorial Network Theory

3. Extremal Problems in the Construction of Distributed Loop Networks

4. Fault-tolerant processor interconnection networks

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The Wide Diameter of the Strong Product Graphs of Star Graphs and Cycles;2024 9th International Conference on Computer and Communication Systems (ICCCS);2024-04-19

2. The Wide Diameter of Strong Product Graphs of Complete Graphs and any Graphs;2023 IEEE 11th International Conference on Information, Communication and Networks (ICICN);2023-08-17

3. Reliability measures in brother trees;Discrete Mathematics, Algorithms and Applications;2023-05-12

4. Combinatorial Properties of Root-fault Hypertrees;Procedia Computer Science;2015

5. Wide Diameter of Generalized Fat Tree;Informatics Engineering and Information Science;2011