首页
按字顺浏览
期刊浏览
卷期浏览
Minimum order graphs with specified diameter, connectivity, and regularity
|
Minimum order graphs with specified diameter, connectivity, and regularity
作者:
V. Krishnamoorthy,
K. Thulasiraman,
M. N. S. Swamy,
期刊:
Networks
(WILEY Available online 1989)
卷期:
Volume 19,
issue 1
页码: 25-46
ISSN:0028-3045
年代: 1989
DOI:10.1002/net.3230190104
出版商: Wiley Subscription Services, Inc., A Wiley Company
数据来源: WILEY
摘要:
AbstractRelationships among graph invariants such as the number of vertices, diameter, connectivity, maximum and minimum degrees, and regularity are being studied recently, motivated by their usefulness in the design of fault‐tolerant and low‐cost communication and interconnection networks. A graph is called a (d,c,r) graph if it has diameterd, connectivityc, and regularityr. The minimum number of vertices in (d, 1,3), (d,2,3), (d,3,3), and (d,c,c) graphs have been reported in the literature. In this paper, the minimum number of vertices in a (d,c,r) graph withr>cis determined, thereby exhausting all the possible choices of values ford,c, andr. Our proof is constructive and hence we get a collection of optimal (d,c,r) gra
点击下载:
PDF
(977KB)
返 回
|
|