✦ LIBER ✦

Perfect Matchings in Total Domination Critical Graphs

✍ Scribed by Michael A. Henning; Anders Yeo

Publisher: Springer Japan
Year: 2010
Tongue: English
Weight: 249 KB
Volume: 27
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-010-1000-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Matching Properties in Total Domination

Matching Properties in Total Domination Vertex Critical Graphs

✍ Haichao Wang; Liying Kang; Erfang Shan 📂 Article 📅 2009 🏛 Springer Japan 🌐 English ⚖ 200 KB

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

Total domination in graphs

✍ E. J. Cockayne; R. M. Dawes; S. T. Hedetniemi 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 374 KB

Perfect matchings in regular bipartite g

Perfect matchings in regular bipartite graphs

✍ P. Katerinis; N. Tsikopoulos 📂 Article 📅 1996 🏛 Springer Japan 🌐 English ⚖ 356 KB

Clustering and domination in perfect gra

Clustering and domination in perfect graphs

✍ D.G. Corneil; Y. Perl 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 793 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