An Upper Bound on the Diameter of a 3-Edge-Connected C4-Free Graph

An Upper Bound on the Diameter of a 3-Edge-Connected C4-Free Graph

We give an upper bound on the diameter of a 3-edge-connected C 4 -free graph in terms of order. In particular we show that if G is a 3-edge-connected C 4 free graph of order n , and diameter d , then the inequality d ≤ 3 n 7 − 3 7 holds. Moreover, graphs are constructed to show that the bound is alm...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Indian journal of pure and applied mathematics 2020, Vol.51 (4), p.1931-1938
Hauptverfasser: Fundikwa, Blessings T., Mazorodze, Jaya P., Mukwembi, Simon
Format: Artikel
Sprache:eng
Schlagworte:
Applications of Mathematics
Mathematics
Mathematics and Statistics
Numerical Analysis
Upper bounds
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We give an upper bound on the diameter of a 3-edge-connected C 4 -free graph in terms of order. In particular we show that if G is a 3-edge-connected C 4 free graph of order n , and diameter d , then the inequality d ≤ 3 n 7 − 3 7 holds. Moreover, graphs are constructed to show that the bound is almost asymptotically sharp.
ISSN:0019-5588
0975-7465
DOI:10.1007/s13226-020-0505-6