English

From the strong differential to Italian domination in graphs

Combinatorics 2021-05-27 v1

Abstract

Given a graph GG and a subset of vertices DV(G)D\subseteq V(G), the external neighbourhood of DD is defined as Ne(D)={uV(G)D:N(u)D}N_e(D)=\{u\in V(G)\setminus D:\, N(u)\cap D\ne \varnothing\}, where N(u)N(u) denotes the open neighbourhood of uu. Now, given a subset DV(G)D\subseteq V(G) and a vertex vDv\in D, the external private neighbourhood of vv with respect to DD is defined to be epn(v,D)={uV(G)D:N(u)D={v}}.epn(v,D)=\{u\in V(G)\setminus D: N(u)\cap D=\{v\}\}. The strong differential of a set DV(G)D\subseteq V(G) is defined as s(D)=Ne(D)Dw,\partial_s(D)=|N_e(D)|-|D_w|, where Dw={vD:epn(v,D)}D_w=\{v\in D: epn(v,D)\neq \varnothing\}. In this paper we focus on the study of the strong differential of a graph, which is defined as s(G)=max{s(D):DV(G)}.\partial_s(G)=\max \{\partial_s(D): D\subseteq V(G)\}. Among other results, we obtain general bounds on s(G)\partial_s(G) and we prove a Gallai-type theorem, which states that s(G)+γI(G)=n(G)\partial_s(G)+\gamma_{I}(G)=n(G), where γIG)\gamma_{I}G) denotes the Italian domination number of GG. 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}
}