𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Power domination in planar graphs with small diameter

✍ Scribed by Min Zhao; Li-ying Kang

Book ID
107482481
Publisher
Chinese Electronic Periodical Services
Year
2007
Tongue
English
Weight
263 KB
Volume
11
Category
Article
ISSN
1007-6417

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

Power Domination in Product Graphs
Power Domination in Product Graphs
✍ Dorbec, Paul; Mollard, Michel; KlavΕΎar, Sandi; Ε pacapan, Simon πŸ“‚ Article πŸ“… 2008 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 271 KB
Dominating Sets in Planar Graphs
Dominating Sets in Planar Graphs
✍ Lesley R. Matheson; Robert E. Tarjan πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 174 KB
Domination in Graphs Applied to Electric
Domination in Graphs Applied to Electric Power Networks
✍ Haynes, Teresa W.; Hedetniemi, Sandra M.; Hedetniemi, Stephen T.; Henning, Micha πŸ“‚ Article πŸ“… 2002 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 162 KB
Nonexistence of certain cubic graphs wit
Nonexistence of certain cubic graphs with small diameters
✍ Leif K. JΓΈrgensen πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 560 KB

We consider the maximum number of vertices in a cubic graph with small diameter. We show that a cubic graph of diameter 4 has at most 40 vertices. (The Moore bound is 46 and graphs with 38 vertices are known.) We also consider bipartite cubic graphs of diameter 5, for which the Moore bound is 62. We