Introduction to coalitions in graphs
| Autor: | Teresa W. Haynes, Jason T. Hedetniemi, Stephen T. Hedetniemi, Alice A. McRae, Raghuveer Mohan |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2020 |
| Předmět: | |
| Zdroj: | AKCE International Journal of Graphs and Combinatorics, Vol 17, Iss 2, Pp 653-659 (2020) |
| Druh dokumentu: | article |
| ISSN: | 0972-8600 2543-3474 09728600 |
| DOI: | 10.1080/09728600.2020.1832874 |
| Popis: | 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 of degree n – 1, or is not a dominating set but forms a coalition with another set which is not a dominating set. In this paper we introduce this concept and study its properties. |
| Databáze: | Directory of Open Access Journals |
| Externí odkaz: |
|