𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On 3--vertex critical graphs of diameter three

✍ Scribed by Mustapha Chellali; Nader Jafari Rad; Abdollah Khodkar

Book ID
113564695
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
354 KB
Volume
160
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On vertex critical graphs with prescribe
On vertex critical graphs with prescribed diameter
✍ L. Caccetta; S. EL-Batanouny; J. Huang πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 167 KB πŸ‘ 1 views

## Abstract Let __G__ be connected simple graph with diameter __d__(__G__). __G__ is said __v__^+^‐critical if __d__(__G__βˆ’__v__) is greater than __d__(__G__) for every vertex __v__ of __G__. Let Dβ€² = max {__d__(__G__βˆ’__v__) : __v__ ∈ __V__(__G__)}. Boals et al. [Congressus Numerantium 72 (1990), 1

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

Maximal and Minimal Vertex-Critical Grap
Maximal and Minimal Vertex-Critical Graphs of Diameter Two
✍ Jing Huang; Anders Yeo πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 446 KB

A graph is vertex-critical if deleting any vertex increases its diameter. We construct, for each & 5 except &=6, a vertex-critical graph of diameter two on & vertices with at least , where c 2 is some constant. We also construct, for each & 5 except &=6, a vertex-critical graph of diameter two on &

On diameter critical graphs
On diameter critical graphs
✍ Louis Caccetta; Roland HΓ€ggkvist πŸ“‚ Article πŸ“… 1979 πŸ› Elsevier Science 🌐 English βš– 520 KB