Introduction to coalitions in graphs
A coalition in a graph consists of two disjoint sets of vertices V1 and V2, neither of which is a dominating set but whose union is a dominating set. A coalition partition in a graph G of order is a vertex partition such that every set Vi of π either is a dominating set consisting of a single vertex...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2020-10-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1080/09728600.2020.1832874 |