ON THE K-DIAMETER OF K-REGULAR K-CONNECTED GRAPHS

被引：1
|
作者：
HSU, DF
LUCZAK, T
机构：
[1] ADAM MICKIEWICZ UNIV POZNAN,DEPT DISCRETE MATH,PL-60769 POZNAN,POLAND
[2] FORDHAM UNIV,DEPT COMP & INFORMAT SCI,BRONX,NY 10458
来源：
DISCRETE MATHEMATICS | 1994年 / 133卷 / 1-3期
关键词：
D O I：
暂无
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
We study the k-diameter of k-regular k-connected graphs. Among other results, we show that every k-regular k-connected graph on n vertices has k-diameter at most n/2 and this upper bound cannot be improved when n = 4k - 6 + i(2k - 4). In particular, the maximal 3-diameter of 3-regular graphs with 2n vertices is equal to n.
引用
收藏
页码：291 / 296
页数：6
相关论文
共 50 条
12345