Italian Reinforcement Number in Graphs

An Italian dominating function (IDF) on a graph G = (V, E) is a function f:V → {0, 1, 2} satisfying the condition that for every vertex v ∈ V with f(v)=0, either v is adjacent to a vertex assigned 2 under f, or v is adjacent to at least two vertices assigned 1 under f. The weig...

Full description

Bibliographic Details
Main Authors: Guoliang Hao, Seyed Mahmoud Sheikholeslami, Shouliu Wei
Format: Article
Language:English
Published: IEEE 2019-01-01
Series:IEEE Access
Subjects:
Online Access:https://ieeexplore.ieee.org/document/8935253/