2019
DOI: 10.3390/math7080714
|View full text |Cite
|
Sign up to set email alerts
|

The Italian Domination Numbers of Generalized Petersen Graphs P(n,3)

Abstract: An Italian dominating function of G is a function f : V ( G ) → { 0 , 1 , 2 } , for every vertex v such that f ( v ) = 0 , it holds that ∑ u ∈ N ( v ) f ( u ) ≥ 2 . The Italian domination number γ I ( G ) is the minimum weight of an Italian dominating function on G. In this paper, we determine the exact values of the Italian domination numbers of P ( n , 3 ) .

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
5
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
7
2

Relationship

1
8

Authors

Journals

citations
Cited by 10 publications
(5 citation statements)
references
References 17 publications
0
5
0
Order By: Relevance
“…A facile seed-mediated synthesis method for the fabrication of spiked AgNSs, using a two-step CM reduction method, was employed for the SERS-based detection of Congo red and probenecid molecules [29,30]. Multi-branched three-dimensional (3D) silver nanostructures on flexible supports, prepared by the electrochemical deposition technique, have shown improved signal uniformity and 10 −9 M LOD [31].…”
Section: Introductionmentioning
confidence: 99%
“…A facile seed-mediated synthesis method for the fabrication of spiked AgNSs, using a two-step CM reduction method, was employed for the SERS-based detection of Congo red and probenecid molecules [29,30]. Multi-branched three-dimensional (3D) silver nanostructures on flexible supports, prepared by the electrochemical deposition technique, have shown improved signal uniformity and 10 −9 M LOD [31].…”
Section: Introductionmentioning
confidence: 99%
“…Recently, Chellali et al [6] have introduced the Roman {2}-dominating function f as follows. A Roman {2}-dominating function is a function f : V → {0, 1, 2} such that for every vertex v ∈ V, with f (v) = 0, f (N(v)) ≥ 2 where f (N(v)) = ∑ x∈N(v) f (x), that is, either v has a neighbor u with f (u) = 2, or has two neighbors x, y with f (x) = f (y) = 1 [7].…”
Section: Introductionmentioning
confidence: 99%
“…In other words, we say that a vertex v for which f (v) ∈ {1, 2} dominates itself, while a vertex v with f (v) = 0 is dominated by f if it has at least two in-neighbors assigned 1 under f or one in-neighbor w with f (w) = 2. An Italian dominating function f : The Italian dominating functions in graphs and digraphs have been studied in [1][2][3][4][5][6][7]. The authors of [2] introduce the concept of Italian domination and give bounds, relating the Italian domination number to some other domination parameters.…”
Section: Introductionmentioning
confidence: 99%