From the strong differential to Italian domination in graphs
Abstract
Given a graph G and a subset of vertices D⊂eq V(G), the external neighbourhood of D is defined as Ne(D)=\u∈ V(G) D:\, N(u) D \, where N(u) denotes the open neighbourhood of u. Now, given a subset D⊂eq V(G) and a vertex v∈ D, the external private neighbourhood of v with respect to D is defined to be epn(v,D)=\u∈ V(G) D: N(u) D=\v\\. The strong differential of a set D⊂eq V(G) is defined as ∂s(D)=|Ne(D)|-|Dw|, where Dw=\v∈ D: epn(v,D)≠ \. In this paper we focus on the study of the strong differential of a graph, which is defined as ∂s(G)= \∂s(D): D⊂eq V(G)\. Among other results, we obtain general bounds on ∂s(G) and we prove a Gallai-type theorem, which states that ∂s(G)+γI(G)=n(G), where γIG) denotes the Italian domination number of G. 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.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.