๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Worst-case efficient dominating sets in digraphs

โœ Scribed by Dejter, Italo J.

Book ID
122825524
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
797 KB
Volume
161
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Efficient dominating sets in Cayley grap
Efficient dominating sets in Cayley graphs
โœ Italo J. Dejter; Oriol Serra ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 506 KB

An independent set C of vertices in a graph is an e cient dominating set (or perfect code) when each vertex not in C is adjacent to exactly one vertex in C. An E-chain is a countable family of nested graphs, each of which has an e cient dominating set. The Hamming codes in the n-cubes provide a clas