Search
Close this search box.

Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

\((k, k’, k”)\)-domination in graphs

Babak Samadi1, Abdollah Khodkar2, Hamid R. Golmochammadi3
1Department of Mathematics Arak University, Arak IRI
2Department of Mathematics University of West Georgia Carrollton, GA 30118, USA
3Department of Mathematics University of Tafresh, Tafresh, IRI
  • Published: 31/08/2016

Abstract

We first introduce the concept of \((k, k’, k”)\)-domination numbers in graphs, which is a generalization of many domination parameters. Then we find lower and upper bounds for this parameter, which improve many well-known results in the literature.

Keywords: (k,k’,k”)-domination number, k-domination number, restrained domination numbers. MSC 2000: 05C69
Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin
1970-2024 CP (Manitoba, Canada) unless otherwise stated.
Citation
Babak Samadi, Abdollah Khodkar, Hamid R. Golmochammadi. \((k, k’, k”)\)-domination in graphs[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 098. 343-349. DOI: .