On size, order, diameter and minimum degree

Simon Mukwembi ()
Additional contact information
Simon Mukwembi: University of KwaZulu-Natal

Indian Journal of Pure and Applied Mathematics, 2013, vol. 44, issue 4, 467-472

Abstract: Abstract 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.

Keywords: Size; diameter; minimum degree (search for similar items in EconPapers)
Date: 2013
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s13226-013-0024-9 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:indpam:v:44:y:2013:i:4:d:10.1007_s13226-013-0024-9

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/13226

DOI: 10.1007/s13226-013-0024-9

Access Statistics for this article

Indian Journal of Pure and Applied Mathematics is currently edited by Nidhi Chandhoke

More articles in Indian Journal of Pure and Applied Mathematics from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().