"Domination Parameters of a Graph and Its Complement" by Wyatt J. Desormeaux, Teresa W. Haynes et al.
 

Domination Parameters of a Graph and Its Complement

Document Type

Article

Publication Date

1-1-2018

Description

A dominating set in a graph G is a set S of vertices such that every vertex in V (G) \ S is adjacent to at least one vertex in S, and the domination number of G is the minimum cardinality of a dominating set of G. Placing constraints on a dominating set yields different domination parameters, including total, connected, restrained, and clique domination numbers. In this paper, we study relationships among domination parameters of a graph and its complement.

Plum Print visual indicator of research metrics
PlumX Metrics
  • Citations
    • Citation Indexes: 5
  • Usage
    • Abstract Views: 17
  • Captures
    • Readers: 10
see details

Share

COinS