Italian domination in rooted product graphs
Combinatorics
2020-06-09 v1
Abstract
In this article, we obtain closed formulae for the Italian domination number of rooted product graphs. As a particular case of the study, we derive the corresponding formulas for corona graphs, and we provide an alternative proof that the problem of computing the Italian domination number of a graph is NP-hard.
Cite
@article{arxiv.2006.02124,
title = {Italian domination in rooted product graphs},
author = {R. Hernandez-Ortiz and L. P. Montejano and J. A. Rodriguez-Velazquez},
journal= {arXiv preprint arXiv:2006.02124},
year = {2020}
}