"Introduction to Coalitions in Graphs" by Teresa W. Haynes, Jason T. Hedetniemi et al.
 

Introduction to Coalitions in Graphs

Document Type

Article

Publication Date

10-24-2020

Description

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.

Plum Print visual indicator of research metrics
PlumX Metrics
  • Citations
    • Citation Indexes: 18
  • Usage
    • Abstract Views: 24
  • Captures
    • Readers: 2
see details

Share

COinS