Self-coalition graphs
A coalition in a graph \(G = (V, E)\) consists of two disjoint sets \(V_1\) and \(V_2\) of vertices, such that neither \(V_1\) nor \(V_2\) is a dominating set, but the union \(V_1 \cup V_2\) is a dominating set of \(G\). A coalition partition in a graph \(G\) of order \(n = |V|\) is a vertex partiti...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
AGH Univeristy of Science and Technology Press
2023-03-01
|
| Series: | Opuscula Mathematica |
| Subjects: | |
| Online Access: | https://www.opuscula.agh.edu.pl/vol43/2/art/opuscula_math_4310.pdf |