A new upper bound on the number of edges in a geodetic graph

被引：1
|
作者：
Mao, JZ [1 ]
Li, DY [1 ]
机构：
[1] Cent China Normal Univ, Dept Math, Wuhan 430079, Hubei, Peoples R China
来源：
DISCRETE MATHEMATICS | 1999年 / 202卷 / 1-3期
关键词：
geodetic graph; number of edges; upper bound;
D O I：
10.1016/S0012-365X(98)00353-7
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
In this paper we investigate some structural characterizations of geodetic graphs and prove that if G is a central geodetic block on p vertices with diameter d greater than or equal to 3, and each vertex belongs to an induced cycle C2d+1, then the number q of edges equals p or q less than or equal to 1/6 p[p - 1/2(5d + 1) + 8]. Therefore the upper bounds of [3] have been considerably improved. (C) 1999 Elsevier Science B.V. All rights reserved.
引用
收藏
页码：183 / 189
页数：7
相关论文
共 50 条
12345