✦ LIBER ✦

Matching Properties in Total Domination Vertex Critical Graphs

✍ Scribed by Haichao Wang; Liying Kang; Erfang Shan

Publisher: Springer Japan
Year: 2009
Tongue: English
Weight: 200 KB
Volume: 25
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-010-0889-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Matching properties in domination critic

Matching properties in domination critical graphs

✍ Nawarat Ananchuen; Michael D. Plummer 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 244 KB

A graph G is said to be k--critical if the size of any minimum dominating set of vertices is k, but if any edge is added to G the resulting graph can be dominated with k -1 vertices. A graph G is factor-critical if G -v has a perfect matching for every vertex v ∈ V (G) and is bicritical if G -u -v h

Vertex domination-critical graphs

✍ Jason Fulman; Denis Hanson; Gary Macgillivray 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 293 KB

Vertex domination-critical graphs

✍ Robert C. Brigham; Phyllis Z. Chinn; Ronald D. Dutton 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 303 KB

Perfect Matchings in Total Domination Cr

Perfect Matchings in Total Domination Critical Graphs

✍ Michael A. Henning; Anders Yeo 📂 Article 📅 2010 🏛 Springer Japan 🌐 English ⚖ 249 KB

Paired Domination Vertex Critical Graphs

✍ Xinmin Hou; Michelle Edwards 📂 Article 📅 2008 🏛 Springer Japan 🌐 English ⚖ 125 KB

Hamiltonian properties of domination-cri

Hamiltonian properties of domination-critical graphs

✍ 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.