Dergiler / MATI / 2026 / Cilt: 1 Sayı: 1

ON SIZE, ORDER, DIAMETER AND VERTEX-CONNECTIVITY

Dergi
MATI
Sayfa
21–24
Yayın Tarihi
2019-01-02
DOI
—
🏛️Bu makalenin bibliyografik verileri ve tam metin bağlantısı DergiPark üzerinden sağlanmıştır.
DergiPark Kaydı ↗
✨

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.

🔖

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

📄 Tam Metin PDF Okuyucu

📄

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

Kaynakça (7)

  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.
  3. P. Dankelmann, L. Volkmann, Minimum size of a graph or digraph of given radius, Inform. Process. Lett. 109(2009), 971{973.
  4. S. Mukwembi, On size, order, diameter and minimum degree, Indian J. Pure Appl. Math. 44 (2013) 467{472.
  5. 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.
  6. A. Tripathi, S. Vijay, On the least size of a graph with a given degree set, Discrete Appl. Math. 154 (2006) 2530{2536.
  7. V. Vizing, The number of edges in a graph of given radius, Soviet. Math. Dokl.8 (1967) 535-536.