✦ LIBER ✦

Diameter-critical graphs

✍ Scribed by N. P. Khomenko; N. A. Ostroverkhii

Book ID: 112478582
Publisher: Springer
Year: 1971
Tongue: English
Weight: 556 KB
Volume: 22
Category: Article
ISSN: 0041-5995
DOI: 10.1007/bf01086522

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On diameter critical graphs

✍ Louis Caccetta; Roland Häggkvist 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 520 KB

On diameter 2-critical graphs

✍ Genghua Fan 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 296 KB

A graph is diameter 2-critical if the graph has diameter 2 and the deletion of any edge increases its diameter. We prove that if G is diameter 2-critical graph on n vertices and e edges, then (i) e ~< [14n2 ] for n <~ 24, and (ii) e < !4n2 + (n 2 -16.2 n + 56)/320 (<0.2532 n2), for n/> 25.

Vertex-critical graphs of given diameter

✍ F. Gliviak 📂 Article 📅 1976 🏛 Akadmiai Kiad 🌐 English ⚖ 484 KB

Minimum vertex-diameter-2-critical graph

Minimum vertex-diameter-2-critical graphs

✍ Ya-Chen Chen; Zoltán Füredi 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 182 KB 👁 1 views

## Abstract We prove that the minimum number of edges in a vertex‐diameter‐2‐critical graph on __n__ ≥ 23 vertices is (5__n__ − 17)/2 if __n__ is odd, and is (5__n__/2) − 7 if __n__ is even. © 2005 Wiley Periodicals, Inc. J Graph Theory

On Critical Graphs of Diameter 2

✍ U. S. R. Murty 📂 Article 📅 1968 🏛 Mathematical Association of America 🌐 English ⚖ 337 KB

The diameter of domination k-critical gr

The diameter of domination k-critical graphs

✍ Odile Favaron; David P. Sumner; Ewa Wojcicka 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 525 KB

## Abstract A graph is __k__‐domination‐critical if γ(__G) = k__, and for any edge __e__ not in __G__, γ(__G + e) = k__ − 1. In this paper we show that the diameter of a domination __k__‐critical graph with __k__ ≧ 2 is at most 2__k__ − 2. We also show that for every __k__ ≧ 2, there is a __k__‐dom