$(k,k',k'')$-domination in graphs
Combinatorics
2019-08-27 v1
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 literatures.
Cite
@article{arxiv.1412.0515,
title = {$(k,k',k'')$-domination in graphs},
author = {Abdollah Khodkar and Babak Samadi and H. R. Golmohammadi},
journal= {arXiv preprint arXiv:1412.0515},
year = {2019}
}