From the strong differential to Italian domination in graphs
Abstract
Given a graph and a subset of vertices , the external neighbourhood of is defined as , where denotes the open neighbourhood of . Now, given a subset and a vertex , the external private neighbourhood of with respect to is defined to be The strong differential of a set is defined as where . In this paper we focus on the study of the strong differential of a graph, which is defined as Among other results, we obtain general bounds on and we prove a Gallai-type theorem, which states that , where denotes the Italian domination number of . Therefore, we can see the theory of strong differential in graphs as a new approach to the theory of Italian domination. One of the advantages of this approach is that it allows us to study the Italian domination number without the use of functions. As we can expect, we derive new results on the Italian domination number of a graph.
Keywords
Cite
@article{arxiv.2105.12557,
title = {From the strong differential to Italian domination in graphs},
author = {A. Cabrera Martinez and J. A. Rodriguez-Velazquez},
journal= {arXiv preprint arXiv:2105.12557},
year = {2021}
}