Abstract
A coalition in a graph consists of two disjoint sets of vertices V 1 and V 2, 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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: AKCE International Journal of Graphs and Combinatorics
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
