𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Diameter-vital edges in a graph

✍ Scribed by H. B. Walikar; Fred Buckley; Medha Itagi Huilgol

Book ID
105752286
Publisher
Springer
Year
2011
Tongue
English
Weight
245 KB
Volume
82
Category
Article
ISSN
0001-9054

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The maximum number of edges in a minimal
The maximum number of edges in a minimal graph of diameter 2
✍ ZoltΓ‘n FΓΌredi πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 717 KB

## Abstract A graph __g__ of diameter 2 is minimal if the deletion of any edge increases its diameter. Here the following conjecture of Murty and Simon is proved for __n__ < __n__~o~. If __g__ has __n__ vertices then it has at most __n__^2^/4 edges. The only extremum is the complete bipartite graph