✨
Yapay Zeka Hızlı Bakış & Çıkarımlar
AI Insight⚡ TL;DR(1 Cümlede Hızlı Çıkarım)
The result is a strengthening of an old classical theorem of Ore [5] if vertex- connectivity is prescribed and constant.
📌 3 Maddede Bu Makale
🎯
Amaç & Hipotez:Let G be a nite connected graph.
📊
Temel Bulgular & Veri:We give an asymptotically sharp upper bound on the size of G in terms of its order, diameter and vertex-connectivity.
💡
Sonuç & Katkı:The result is a strengthening of an old classical theorem of Ore [5] if vertex- connectivity is prescribed and constant.
🔬Tür:Araştırma Makalesi
📍Kapsam:Genişletilmiş Akademik Örneklem
⚙️Değişkenler: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.
Anahtar kelimeler
🔖
Bu Makaleye Atıf Yap
Munyira, S., Mukwembi, S. (2019). ON SIZE, ORDER, DIAMETER AND VERTEX-CONNECTIVITY. MATI, Cilt: 1 Sayı: 1, 21–24. https://ajindex.com/articles/1596353