Zobrazeno 1 - 10
of 93
pro vyhledávání: '"Desormeaux Wyatt J."'
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 41, Iss 2, Pp 633-645 (2021)
A self-complementary graph is a graph isomorphic to its complement. A set S of vertices in a graph G is a restrained dominating set if every vertex in V(G) \ S is adjacent to a vertex in S and to a vertex in V(G) \ S. The restrained domination number
Externí odkaz:
https://doaj.org/article/d995801dbe824214ba2206aed1735822
Publikováno v:
In Discrete Applied Mathematics 10 July 2018 243:186-193
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 38, Iss 1, Pp 203-215 (2018)
A dominating set in a graph G is a set S of vertices such that every vertex in V (G) \ S is adjacent to at least one vertex in S, and the domination number of G is the minimum cardinality of a dominating set of G. Placing constraints on a dominating
Externí odkaz:
https://doaj.org/article/6b27bae5041246ee98e618091c5bd090
Publikováno v:
In Discrete Applied Mathematics 31 May 2017 223:52-63
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 36, Iss 4, Pp 1043-1050 (2016)
A set S of vertices of a graph G is a dominating set if every vertex not in S is adjacent to a vertex of S and is a total dominating set if every vertex of G is adjacent to a vertex of S. The cardinality of a minimum dominating (total dominating) set
Externí odkaz:
https://doaj.org/article/6193cdfe45264a6594c066eed9191c8c
Publikováno v:
In Discrete Applied Mathematics 10 July 2016 207:39-44
Publikováno v:
In Discrete Applied Mathematics 20 November 2014 177:88-94
Publikováno v:
In Discrete Applied Mathematics December 2013 161(18):2925-2931
Publikováno v:
In Discrete Applied Mathematics February 2013 161(3):349-354
Publikováno v:
In Discrete Mathematics 2010 310(24):3446-3454