✦ LIBER ✦

Planar domination graphs

✍ Scribed by Elaine M. Eschen; William F. Klostermeyer; R. Sritharan

Book ID: 108315837
Publisher: Elsevier Science
Year: 2003
Tongue: English
Weight: 126 KB
Volume: 268
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(02)00684-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Domination numbers of planar graphs

✍ MacGillivray, G.; Seyffarth, K. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 967 KB

The problem of determining the domination number of a graph is a well known NPhard problem, even when restricted to planar graphs. By adding a further restriction on the diameter of the graph, we prove that planar graphs with diameter two and three have bounded domination numbers. This implies that

[Springer Monographs in Mathematics] Tot

[Springer Monographs in Mathematics] Total Domination in Graphs || Total Domination in Planar Graphs

✍ Henning, Michael A.; Yeo, Anders 📂 Article 📅 2013 🏛 Springer New York ⚖ 113 KB

Domination in planar graphs with small d

Domination in planar graphs with small diameter

✍ Wayne Goddard; Michael A. Henning 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 199 KB

## Abstract MacGillivray and Seyffarth (J Graph Theory 22 (1996), 213–229) proved that planar graphs of diameter two have domination number at most three and planar graphs of diameter three have domination number at most ten. They also give examples of planar graphs of diameter four having arbitrar

Dominating Sets in Planar Graphs

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

Power domination in planar graphs with s

Power domination in planar graphs with small diameter

✍ Min Zhao; Li-ying Kang 📂 Article 📅 2007 🏛 Chinese Electronic Periodical Services 🌐 English ⚖ 263 KB

Domination critical graphs

✍ David P Sumner; Pattie Blitch 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 531 KB