✦ LIBER ✦

Total domination critical and stable graphs upon edge removal

✍ Scribed by Wyatt J. Desormeaux; Teresa W. Haynes; Michael A. Henning

Book ID: 108112886
Publisher: Elsevier Science
Year: 2010
Tongue: English
Weight: 292 KB
Volume: 158
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2010.06.003

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Total domination stable graphs upon edge

Total domination stable graphs upon edge addition

✍ Wyatt J. Desormeaux; Teresa W. Haynes; Michael A. Henning 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 254 KB

Domination parameters and edge-removal-c

Domination parameters and edge-removal-critical graphs

✍ P.J.P. Grobler; C.M. Mynhardt 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 160 KB

Properties of total domination edge-crit

Properties of total domination edge-critical graphs

✍ Michael A. Henning; Lucas C. van der Merwe 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 566 KB

On the existence of -partite or -free to

On the existence of -partite or -free total domination edge-critical graphs

✍ Teresa W. Haynes; Michael A. Henning; Lucas C. van der Merwe; Anders Yeo 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 304 KB

Note: The diameter of edge domination cr

Note: The diameter of edge domination critical graphs

✍ Matteo Paris 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 111 KB

Balloons, cut-edges, matchings, and tota

Balloons, cut-edges, matchings, and total domination in regular graphs of odd degree

✍ Suil O; Douglas B. West 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 148 KB 👁 1 views

## Abstract A __balloon__ in a graph __G__ is a maximal 2‐edge‐connected subgraph incident to exactly one cut‐edge of __G__. Let __b__(__G__) be the number of balloons, let __c__(__G__) be the number of cut‐edges, and let α′(__G__) be the maximum size of a matching. Let \documentclass{article}\usep