✦ LIBER ✦

Dominating Sets in Chordal Graphs

✍ Scribed by Booth, Kellogg S.; Johnson, J. Howard

Book ID: 121652366
Publisher: Society for Industrial and Applied Mathematics
Year: 1982
Tongue: English
Weight: 977 KB
Volume: 11
Category: Article
ISSN: 0097-5397
DOI: 10.1137/0211015

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimum paired-dominating set in chordal

Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs

✍ Panda, B. S.; Pradhan, D. 📂 Article 📅 2012 🏛 Springer US 🌐 English ⚖ 571 KB

Parameterized dominating set problem in

Parameterized dominating set problem in chordal graphs: complexity and lower bound

✍ Chunmei Liu; Yinglei Song 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 305 KB

Dominating cliques in chordal graphs

✍ Dieter Kratsch; Peter Damaschke; Anna Lubiw 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 492 KB

A chordal graph has a dominating clique iff it has diameter at most 3. A strongly chordal graph which has a dominating clique has one as small as the smallest dominating set-and, furthermore, there is a linear-time algorithm to find such a small dominating clique.

Independent domination in chordal graphs

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

Dominating Sets in Planar Graphs

✍ Lesley R. Matheson; Robert E. Tarjan 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 174 KB

Edge Dominating Sets in Graphs

✍ M. Yannakakis and F. Gavril 📂 Article 📅 1980 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 968 KB