Graph colouring is a fundamental problem in both theoretical and applied combinatorics, with significant implications for computer science, operational research and network theory. At its essence, ...
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 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback