Journals / MATI / 2019 / Cilt: 1 - Sayı: 1

ON SIZE, ORDER, DIAMETER AND VERTEX-CONNECTIVITY

Journal
MATI
Pages
21–24
Publication Date
2019-01-02
DOI
—
🏛️Bibliographic metadata and full text access for this article are provided via DergiPark.
DergiPark Record ↗
✨

AI Summary & Key Takeaways

AI Insight
⚡ TL;DR(Too Long; Didn't Read)

The result is a strengthening of an old classical theorem of Ore [5] if vertex-connectivity is prescribed and constant.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:Let G be a nite connected graph.
📊
Key Findings & Data:We give an asymptotically sharp upper bound on the size of G in terms of its order, diameter and vertex-connectivity.
💡
Conclusion & Impact:The result is a strengthening of an old classical theorem of Ore [5] if vertex-connectivity is prescribed and constant.
🔬Design:Research Article
📍Scope:Comprehensive Sample
⚙️Variables:size · vertex-connectivity · diameter

Abstract

Let G be a nite connected graph. We give an asymptotically sharp upper bound on the size of G in terms of its order, diameter and vertex-connectivity. The result is a strengthening of an old classical theorem of Ore [5] if vertex-connectivity is prescribed and constant.

🔖

Cite This Article

MUNYİRA, S., MUKWEMBİ, S. (2019). ON SIZE, ORDER, DIAMETER AND VERTEX-CONNECTIVITY. MATI, Cilt: 1 - Sayı: 1, 21–24. https://ajindex.com/articles/839438

📄 Full Text PDF Viewer

📄

PDF görüntüleyici hazırlanıyor...

References (2)

  1. F.R.K. Chung, The average distance and the independence number, J. Graph Theory. 12 (1988) 229-235.
  2. P. Dankelmann, G.S. Domke, W. Goddard, P. Grobler J.H. Hattingh, H.C Swart, Maximum sizes of graphs with given domination parameters, DiscreteMath. 281 (2004) 137{148. P. Dankelmann, L. Volkmann, Minimum size of a graph or digraph of given radius, Inform. Process. Lett. 109(2009), 971{973. S. Mukwembi, On size, order, diameter and minimum degree, Indian J. Pure Appl. Math. 44 (2013) 467{472. O. Ore, Diameters in graphs, J. Combin. Theory 5 (1968) 75{81.Z. Tao, X. Junming, L. Jun, On diameters and average distance of graphs, Transactions 8 (2004) 1{6. A. Tripathi, S. Vijay, On the least size of a graph with a given degree set, Discrete Appl. Math. 154 (2006) 2530{2536. V. Vizing, The number of edges in a graph of given radius, Soviet. Math. Dokl.8 (1967) 535-536.