Worst-case efficient dominating sets in digraphs

Italo J. Dejter

Worst-case efficient dominating sets in digraphs

Combinatorics 2012-06-28 v3 Information Theory math.IT

Authors: Italo J. Dejter

Abstract

Let $1\le n\in\Z$ . {\it Worst-case efficient dominating sets in digraphs} are conceived so that their presence in certain strong digraphs $\vec{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 $\vec{ST}_n$ . Related chains of graphs and open problems are presented as well.

Keywords

graph theory

Cite

@article{arxiv.1201.1728,
  title  = {Worst-case efficient dominating sets in digraphs},
  author = {Italo J. Dejter},
  journal= {arXiv preprint arXiv:1201.1728},
  year   = {2012}
}

Comments

13 pages, 3 figures

Related papers

View all related →

Discrete Mathematics · Computer Science

Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs