Results 91 to 100 of about 264 (111)
Hypergraphs with large transversal number and with edge sizes at least four
Open Mathematics, 2012 Henning Michael, Löwenstein Christian
doaj +1 more source
A lower bound for the packing chromatic number of the Cartesian product of cycles
Open Mathematics, 2013 Jacobs Yolandé +2 more
doaj +1 more source
Quaestiones Mathematicae, 2017 A subset D of the vertex set of a graph G is a secure dominating set of G if D is a dominating set of G and if, for each vertex u not in D, there is a vertex v in D adjacent to u such that the swap set (D \ {v}) {u} is again a dominating set of G.
Jin Xu, Zehui Shao, Zepeng Li
exaly +2 more sources
The security number of lexicographic products
Quaestiones Mathematicae, 2018 A subset S of vertices of a graph G is a secure set if |N[X] ∩ S| ≥ |N[X]−S| holds for any subset X of S, where N[X] denotes the closed neighborhood of X. The minimum cardinality s(G) of a secure set in G is called the security number of G.
Iztok Peterin +2 more
exaly +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Total Roman {2}-domination in graphs
Quaestiones Mathematicae, 2021Ismael Gonzalez Yero +2 more
exaly
On [k] -Roman domination in graphs
AKCE International Journal of Graphs and Combinatorics, 2023Mustapha Chellali +1 more
exaly
The Domination Number of Grids
SIAM Journal on Discrete Mathematics, 2011Alexandre Pinlou +2 more
exaly