Improving the Bounds On Murty_Simon Conjecture

A graph is said to be diameter-\(k\)-critical if its diameter is \(k\) and removal of any of its edges increases its diameter. A beautiful conjecture by Murty and Simon, says that every diameter-2-critical graph of order \(n\) has at most \(\lfloor n^2/4\rfloor\) edges and equality holds only for \(...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2016-10
Hauptverfasser:	Jabalameli, Afrouz, behjati, Amin, Saghafian, Morteza, Shokri, MohammadMahdi, Ferdosi, Mohsen, Bahariyan, Sorush
Format:	Artikel
Sprache:	eng
Schlagworte:	Graph theory
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!