On size, order, diameter and minimum degree

被引：5

作者：

Mukwembi, Simon ^{[1
]}

机构：

[1] Univ KwaZulu Natal, Sch Math Stat & Comp Sci, Kwa Zulu, South Africa

来源：

INDIAN JOURNAL OF PURE & APPLIED MATHEMATICS | 2013年 / 44卷 / 04期

基金：

新加坡国家研究基金会;

关键词：

Size; diameter; minimum degree; GRAPHS;

D O I：

10.1007/s13226-013-0024-9

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Let G be a finite connected graph. We give an asymptotically tight upper bound on the size of G in terms of order, diameter and minimum degree. Our result is a strengthening of an old classical theorem of Ore [Diameters in graphs, J. Combin. Theory, 5 (1968), 75-81] if minimum degree is prescribed and constant.

引用

页码：467 / 472

页数：6

共 8 条

[1] On the sizes of graphs and their powers: The undirected case [J].