Electrical Engineering and Computer Science Faculty Publications

Document Type

Article

Publication Title

AKCE International Journal of Graphs and Combinatorics

Abstract

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. © 2020 The Author(s). Published with license by Taylor & Francis Group, LLC.

First Page

653

DOI

10.1080/09728600.2020.1832874

Publication Date

2020

Download

Share

COinS