Worst-case efficient dominating sets in digraphs
Abstract
Let 1 n∈. Worst-case efficient dominating sets in digraphs are conceived so that their presence in certain strong digraphs STn corresponds to that of efficient dominating sets in star graphs STn: The fact that the star graphs STn form a so-called dense segmental neighborly E-chain is reflected in a corresponding fact for the digraphs STn. Related chains of graphs and open problems are presented as well.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.