✦ LIBER ✦

Roman domination on strongly chordal graphs

✍ Scribed by Chun-Hung Liu, Gerard J. Chang

Book ID: 120694150
Publisher: Springer US
Year: 2012
Tongue: English
Weight: 500 KB
Volume: 26
Category: Article
ISSN: 1382-6905
DOI: 10.1007/s10878-012-9482-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Domination, independent domination, and

Domination, independent domination, and duality in strongly chordal graphs

✍ Martin Farber 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 1006 KB

Rainbow domination and related problems

Rainbow domination and related problems on strongly chordal graphs

✍ Chang, Gerard J.; Li, Bo-Jr; Wu, Jiaojiao 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 403 KB

The parallel solution of domination prob

The parallel solution of domination problems on chordal and strongly chordal graphs

✍ Elias Dahlhaus; Peter Damaschke 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 975 KB

Steiner trees, connected domination and

Steiner trees, connected domination and strongly chordal graphs

✍ Kevin White; Martin Farber; William Pulleyblank 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 829 KB

Independent domination in chordal graphs

✍ Martin Farber 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 460 KB

Finding dominating cliques efficiently,

Finding dominating cliques efficiently, in strongly chordal graphs and undirected path graphs

✍ Dieter Kratsch 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 914 KB

We study a new version of the domination problem in which the dominating set is required to be a clique. The minimum dominating clique problem is NP-complete for split graphs and, hence, for chordal graphs. We show that for two other important subclasses of chordal graphs the problem is solvable eff