✨
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.
Keywords
🔖
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