Dominating Sequences in Grid-Like and Toroidal Graphs
نویسندگان
چکیده
منابع مشابه
Dominating Sequences in Grid-Like and Toroidal Graphs
A longest sequence S of distinct vertices of a graph G such that each vertex of S dominates some vertex that is not dominated by its preceding vertices, is called a Grundy dominating sequence; the length of S is the Grundy domination number of G. In this paper we study the Grundy domination number in the four standard graph products: the Cartesian, the lexicographic, the direct, and the strong ...
متن کاملDominating sequences in graphs
A sequence of vertices in a graph G is called a legal dominating sequence if every vertex in the sequence dominates at least one vertex not dominated by those vertices that precede it, and at the end all vertices of G are dominated. While the length of a shortest such sequence is the domination number of G, in this paper we investigate legal dominating sequences of maximum length, which we call...
متن کاملOn independent domination numbers of grid and toroidal grid directed graphs
A subset $S$ of vertex set $V(D)$ is an {em indpendent dominating set} of $D$ if $S$ is both an independent and a dominating set of $D$. The {em indpendent domination number}, $i(D)$ is the cardinality of the smallest independent dominating set of $D$. In this paper we calculate the independent domination number of the { em cartesian product} of two {em directed paths} $P_m$ and $P_n$ for arbi...
متن کاملTotal dominating sequences in graphs
A vertex in a graph totally dominates another vertex if they are adjacent. A sequence of vertices in a graph G is called a total dominating sequence if every vertex v in the sequence totally dominates at least one vertex that was not totally dominated by any vertex that precedes v in the sequence, and at the end all vertices of G are totally dominated. While the length of a shortest such sequen...
متن کاملToroidal Grid Minors and Stretch in Embedded Graphs∗
1 We investigate the toroidal expanse of an embedded graph G, that is, the size of the largest 2 toroidal grid contained in G as a minor. In the course of this work we introduce a new embedding 3 density parameter, the stretch of an embedded graph G, and use it to bound the toroidal 4 expanse from above and from below within a constant factor depending only on the genus and 5 the maximum degree...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2016
ISSN: 1077-8926
DOI: 10.37236/6269