𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Locating–dominating codes in paths

✍ Scribed by Geoffrey Exoo; Ville Junnila; Tero Laihonen

Book ID
108114321
Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
307 KB
Volume
311
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Long dominating cycles and paths in grap
Long dominating cycles and paths in graphs with large neighborhood unions
✍ H. J. Broersma; H. J. Veldman 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 413 KB 👁 1 views

## Abstract Let __G__ be a graph of order __n__ and define __NC(G)__ = min{|__N__(__u__) ∪ __N__(__v__)| |__uv__ ∉ __E__(__G__)}. A cycle __C__ of __G__ is called a __dominating cycle__ or __D__‐__cycle__ if __V__(__G__) ‐ __V__(__C__) is an independent set. A __D__‐__path__ is defined analogously.