𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Properties of total domination edge-critical graphs

✍ Scribed by Michael A. Henning; Lucas C. van der Merwe


Book ID
108112842
Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
566 KB
Volume
158
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Local edge domination critical graphs
✍ Michael A. Henning; Ortrud R. Oellermann; Henda C. Swart πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 521 KB

Sumner and Blitch defined a graph G to be k-y-critical if 7(G) = k and 7(G + uv) = k -1 for each pair u, v of nonadjacent vertices of G. We define a graph to be k-( 7,d)-critical if 7(G) = k and 7(G + uv) = k -I for each pair u, v of nonadjacent vertices of G that are at distance at most d apart. Th

Hamiltonian properties of domination-cri
✍ Ewa Wojcicka πŸ“‚ Article πŸ“… 1990 πŸ› John Wiley and Sons 🌐 English βš– 445 KB

## Abstract In this paper we show that every connected, 3‐γ‐critical graph on more than 6 vertices has a Hamiltonian path.