✦ LIBER ✦

On Critical Graphs of Diameter 2

✍ Scribed by U. S. R. Murty

Book ID: 121814310
Publisher: Mathematical Association of America
Year: 1968
Tongue: English
Weight: 337 KB
Volume: 41
Category: Article
ISSN: 0025-570X
DOI: 10.2307/2688184

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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.

On diameter critical graphs

✍ Louis Caccetta; Roland Häggkvist 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 520 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

Diameter-critical graphs

✍ N. P. Khomenko; N. A. Ostroverkhii 📂 Article 📅 1971 🏛 Springer 🌐 English ⚖ 556 KB

A characterization of -free, diameter-2-

A characterization of -free, diameter-2-critical graphs

✍ Haynes, Teresa W.; Henning, Michael A. 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 367 KB

On 4--critical graphs of diameter two

✍ Wang, Yan; Wang, Chunxiang 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 865 KB