Symmetry | Free Full-Text | On Three-Rainbow Dominationof Generalized Petersen Graphs
P(ck,k) Next Article in Journal Symmetry Analysis of the Complex Polytypism of Layered …

A double Roman dominating function on a graph G=(V, E) is a function f: V→{0, 1, 2, 3},
satisfying the condition that every vertex u for which f (u)= 1 is adjacent to at least one vertex …

A double Roman dominating function on a graph G=(V, E) is a function f: V→{0, 1, 2, 3}
satisfying the condition that every vertex u for which f (u)= 0 is adjacent to at least one vertex …

Mathematics | Free Full-Text | On 2-Rainbow Domination of Generalized Petersen Graphs P(ck,k)
Next Article in Journal Determining the Main Resilience Competencies by Applying Fuzzy …

If G is a graph and na positive integer, then the generalized Sierpiński graph SG n is a fractal-
like graph that uses G as a building block. The construction of SG n generalizes the classical …