Domination parameters of a graph and its complement | Zendy

Wyatt J. Desormeaux | Zendy; Teresa W. Haynes | Zendy; Michael A. Henning | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Domination parameters of a graph and its complement

Author(s) -

Wyatt J. Desormeaux,

Teresa W. Haynes,

Michael A. Henning

Publication year - 2017

Publication title -

discussiones mathematicae graph theory

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.476

H-Index - 19

eISSN - 2083-5892

pISSN - 1234-3099

DOI - 10.7151/dmgt.2002

Subject(s) - mathematics , combinatorics , complement (music) , graph , domination analysis , discrete mathematics , vertex (graph theory) , biochemistry , complementation , gene , phenotype , chemistry

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research