Worst-case efficient dominating sets in digraphs

Authors:
Italo J. Dejter
Affiliations:
-
Venue:
Discrete Applied Mathematics
Year:
2013

Citing 3
Cited 0

Perfect codes over graphs

Journal of Combinatorial Theory Series B
A Group-Theoretic Model for Symmetric Interconnection Networks

IEEE Transactions on Computers
Disjoint Hamilton cycles in the star graph

Information Processing Letters

Quantified Score

Hi-index	0.04

Visualization

Abstract

Let 1@?n@?Z. Worst-case efficient dominating sets in digraphs are conceived so that their presence in certain strong digraphs ST-"n corresponds to that of efficient dominating sets in star graphs ST"n. The fact that the star graphs ST"n form a so-called dense segmental neighborly E-chain is reflected in a corresponding fact for the digraphs ST-"n. Related chains of graphs and open problems are presented as well.