Geometric intersection graphs form an intriguing class of structures in which vertices represent geometric objects – such as line segments, discs, or curves – and an edge is established between two ...
The 2-domination number γ₂(G) of a graph G is the minimum cardinality of a set S ⊆ V(G) such that every vertex from V(G) \ S is adjacent to at least two vertices in S. The annihilation number a(G) is ...
A map f : V → {0, 1, 2} is a Roman dominating function on a graph G = (V, E) if for every vertex v ∈ V with f(v) = 0, there exists a vertex u, adjacent to v, such that f(u) = 2. The weight of a Roman ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback