A coalition in a graph (Formula presented.) consists of two disjoint sets of vertices V 1 and V 2, neither of which is a dominating set but whose union (Formula presented.) is a dominating set. A coalition partition in a graph G of order (Formula presented.) is a vertex partition (Formula presented.) 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 (Formula presented.) which is not a dominating set. In this paper we introduce this concept and study its properties.
| Identifer | oai:union.ndltd.org:ETSU/oai:dc.etsu.edu:etsu-works-10512 |
| Date | 24 October 2020 |
| Creators | Haynes, Teresa W., Hedetniemi, Jason T., Hedetniemi, Stephen T., McRae, Alice A., Mohan, Raghuveer |
| Publisher | Digital Commons @ East Tennessee State University |
| Source Sets | East Tennessee State University |
| Detected Language | English |
| Type | text |
| Source | ETSU Faculty Works |
Page generated in 0.0036 seconds