A New Upper Bound for the Perfect Italian Domination Number of a Tree
A perfect Italian dominating function (PIDF) on a graph G is a function f : V (G) → {0, 1, 2} satisfying the condition that for every vertex u with f(u) = 0, the total weight of f assigned to the neighbors of u is exactly two. The weight of a PIDF is the sum of its functions values over all vertices...
Main Authors: | Nazari-Moghaddam Sakineh, Chellali Mustapha |
---|---|
Format: | Article |
Language: | English |
Published: |
University of Zielona Góra
2022-08-01
|
Series: | Discussiones Mathematicae Graph Theory |
Subjects: | |
Online Access: | https://doi.org/10.7151/dmgt.2324 |
Similar Items
-
Perfect double Italian domination of a graph
by: Guoliang Hao, et al.
Published: (2023-09-01) -
Bounds on the Double Italian Domination Number of a Graph
by: Azvin Farzaneh, et al.
Published: (2022-11-01) -
Domination parameters of generalized Sierpiński graphs
by: Jismy Varghese, et al.
Published: (2024-01-01) -
On a Relation between the Perfect Roman Domination and Perfect Domination Numbers of a Tree
by: Zehui Shao, et al.
Published: (2020-06-01) -
Extremal Graphs for a Bound on the Roman Domination Number
by: Bouchou Ahmed, et al.
Published: (2020-08-01)