Sierpinski Graphs_GSA
Sierpinski Graphs_GSA
Abstract. In this article, we determine the exact values of the double Ital-
ian and perfect double Italian domination number of generalized Sierpiński
graphs S(G, t), when t = 2. In particular, when G = Cn or a graph having
exactly one universal vertex or a graph having at least two universal vertices.
1. Introduction
In this paper we study the Roman-{3} domination or double Italian domi-
nation number and the perfect double Italian domination number of the gener-
alised Sierpiński graph S(G, t). Let us begin with some required terminology.
Let G = (V, E) be a graph of order n with vertex set V = V (G) and edge set
E = E(G). Let Cn , Pn and Kn be respectively the cycle, path and complete graph
on n vertices. A tree is a connected graph with no cycles. The open neighbourhood
of a vertex v ∈ V (G) is the set N (v) = {u : uv ∈ E(G)}. The closed neighborhood
of a vertex v ∈ V (G) is N [v] = N (v)∪{v}. |N (v)| is called the degree of the vertex
v ∈ G and is denoted by d(v). The maximum degree of a vertex in G is denoted
by ∆(G). A vertex of degree 0 is known as an isolated vertex of G. A vertex of
degree 1 is called a leaf vertex. A vertex of degree n − 1 is a universal vertex,
where n = |V (G)|. If S is a non-empty subset of the vertex set V of the graph G
then the sub-graph induced by S is defined as the graph having vertex set S and
edge set consisting of edges of G having both ends in S. All graphs considered
here are simple and undirected. For any graph theoretic terminology, definition or
notation not mentioned in this article, the readers may refer to [10, 4, 3, 5, 6].
In [10], Mojdeh and Volkmann introduced the concept of double Italian domi-
nation, which is a variant of Roman domination. The origin of Roman domination
was motivated by the defense strategies used to defend the Roman Empire dur-
ing the reign of the Great, Emperor Constantine. Double Italian domination is
an optimization of a stronger version of the Roman domination. In [4], Hao et
al. initiated the study of perfect double Italian domination. They evaluated the
P
γdI of some standard graphs and examined the corresponding γdI . In [11], the
Roman domination number of generalized Sierpiński graph S(G, t) is studied and
general upper bound is found and its tightness observed. In [7], the exact Italian
domination, perfect Italian domination and double Roman domination number of
Proof. Let V (Cn ) = {v1 , v2 , . . . , vn }. Then S (Cn , 2) has the vertex set {vi vj : i, j ∈ {1 , 2 , . . . , n}}
and edge set {(vi vj , vi vk ) : vj vk ∈ E (Cn )} ∪ {(vi vj , vj vi )} : vi vj ∈ E (Cn )}. Now,
Consider the function,
1
i ∈ {1, 2, 3, . . . n}, j = i + 1(modn)
f (vi vj ) = 2 i ∈ {1, 2, 3, . . . n}, j = i + 1 + 2l(modn), l = 1, 2, 3, . . . n − 4
0 otherwise
Corollary 2.2. The perfect double Italian domination number of generalised Sierpiński
P
graph S (Cn , 2) is γdI (S (Cn , 2)) = n(n − 1) for n ⩾ 3.
Proof. Consider the function,
1 i ∈ {1, 2, 3, . . . n}, j = i + 1(modn)
f (vi vj ) = 2 i ∈ {1, 2, 3, . . . n}, j = i + 1 + 2l(modn), l = 1, 2, 3, . . . n − 4
0 otherwise
P
in Theorem 2.1, it is a PDIDF on S (Cn , 2) as well.So, γdI (S (Cn , 2)) ⩽ n + 2n+
n−4
P
2 2 n = n(n − 1) and γdI (S (Cn , 2)) ⩽ γdI (S (Cn , 2)).Hence by Theorem 2.1,
P P
n(n − 1 ) ⩽ γdI (S (Cn , 2 )).So, γdI (S (Cn , 2)) = n(n − 1 ). □
Remark 2.3. In [7], γdR ( S (Cn , 2 )) is found and we get γdI ( S (Cn , 2 )) <
γdR ( S (Cn , 2 )) for n ̸= 3k +1 , k ⩾ 1 . Note that we have used the same technique
to prove so.
Remark 3.2. Clearly γdI (S(G, 2)) = γdR (S(G, 2)) = 3n −1 because if there exists
a γdI - function f such that f (v ) = 1 for no v ∈ V (G) then γdI (G) = γdR (G). In
particular γdI (S (Kn , 2)) = 3n − 1 and γdI (S (K1,q , 2)) = 3q + 2 . Note that for
P
a graph G with no edges and n vertices, γdI (G) = γdI (G) = 2n.
6 M. NANJUNDASWAMY, PUTTASWAMY, NAYAKA S. R., AND P. S. K. REDDY
Remark 3.3. Note that if G contains no universal vertex γdI (S(G, 2)) > 3n − 1 .
The motivation for the above proof is from [1, 2].
Theorem 2.4. The perfect double Italian domination number of the generalised
Sierpiński graph S(G, 2) is given by
(
P 3n − 1 G ∈ G
γdI (S(G, 2)) =
3n otherwise
where, G is the class of graphs with exactly one universal vertex and all other
vertices of degree n − 2 where n ≡ 1(mod4), for n ⩾ 3.
Proof. Consider S(G, 2). Let V = {v1 , v2 , . . . vn } be the vertex set of G having ex-
actly one universal vertex v1 . Then let {v1 v1 , v2 v1 , . . . vn v1 } be the corresponding
vertices on each copy of G, say Gi , i = 1, 2, 3, . . . n. in S(G, 2). Then G1 contains
the extreme vertex v1 v1 . Consider the function
(
3 vi v1 ∈ {2, 3, . . . n}, u = v1 vj for some j ̸= 1
f (u) =
0 otherwise
P
Clearly this function is a PDIDF of S(G, 2). So, γdI S (G, 2 ) ⩽ 3n. Now con-
P P
versely, γdI (S(G, 2)) ⩽ γdI (S(G, 2)).So,by Theorem 3.1, 3n − 1 ⩽ γdI (S (G, 2 )).If
P
possible let f be a γdI - function such that f (S (G, 2 )) = 3n − 1 , then G has a uni-
versal vertex by Remark 3.3.Since G has exactly one universal vertex v1 , f (v1 v1 ) =
2 = f G 1 by Theorem 3.1.If f (vj v1 ) = 3 for some j ̸= 1 , then f (N [vj v1 ]) = 5 .
To perfect double italian dominate
we must have 3 ≤ f (N [vj v1 ]) ≤ 4 . Hence
1 ≤ f (vj v1 ) ≤ 2 and f G j = 3, for j ̸= 1 . There arise two cases.
Case 1. For some j , f (vj vj ) ̸= 0 If f (vj v1 ) = 1 , either f (vj vj ) = 1 and
f (vj vk ) = 1 such that vj vk and vj vj are adjacent in Gj or f (vj vj ) = 2 . If
f (vj v1 ) = 2 , then f (vj vj ) = 1 . Consider Gj , since there exists only one universal
vertex in the base graph which corresponds to vj v1 in Gj there exists at least
one vertex vj vs perfect double italian dominated by vs vj , s ̸= 1 , j , k . ie, vj vs is
adjacent to vj vj .This is true for all such S. Then vj vj , j ̸= 1 is adjacent to all
other vertices in Gj , a contradiction.
Case 2. f (vj vj ) = 0 for all j . If f (vj vj ) = 0 then either f (vj v1 ) = 1 and
f (vj vk ) = 2 or vice versa such that vj vk and vj vj are adjacent in Gj .For definite-
ness let f (vj v1 ) = 1 for any j.First let us prove the following Claim A.
P
Claim A: γdI (S(G, 2)) = 3n − 1 for G ∈ G where, G is the class of graphs
with exactly one universal vertex and all other vertices of degree n − 2 and n ≡
1(mod4), for n ⩾ 3
Suppose there exists at least one vertex with degree at most n-3, say vl in
G.If there exists no Gk , k ̸= l , such that vl vk is perfect double Italian dominated
by vk vl ie, in Gl all vertices vl vk , for all k , is perfect double Italian dominated
by Gl alone, a contradiction as base graph G has exactly one universalvertex.So,
there exists a Gk , k ̸= l , such that vl vk is perfect double Italian dominated by
vk vl ie, f (vk vl ) = 2 because f (vl v1 ) = 1 and f (vk v1 ) = 1 then, there exists at
least two vertices vk vj and vk vi not perfect double Italian dominated by vk vl in
Gk , i, j ̸= k , l and i ̸= j · So, f (vj vk ) = 2 and f (vi vk ) = 2 . Again in Gj and Gi
ON DOMINATION OF SIERPINSKI GRAPHS 7
In Fig. 2 the majenta colour vertices represent those vertices with weight 2
and cyan colour vertices represent those with weight 1 and all other vertices are
P
of weight 0 and it represents the γdI - function given below. If n ≡ 3 (mod4 ) the
above process of perfect double Italian domination cannot be done for the last
remaining
two distinct copies of G in S(G, 2).Now consider the function,
1 i ∈ {2, 3, . . . n}, j = 1
2 i ∈ {2, 3, 4, 6, 7, 8, . . . n − 1}, j = i + 1 or
f (vi vj ) =
i ∈ {5, 9, 13 . . . n}, j = i − 3 or i = j = 1
0 otherwise
Clearly this is a PDIDF with f (S (G, 2 )) = (n − 1 ) + 2n = 3n − 1 . So,
P P
γdI (S(G, 2)) ⩽ 3n − 1 for G ∈ G alone, leading to γdI (S(G, 2)) = 3n − 1 for
8 M. NANJUNDASWAMY, PUTTASWAMY, NAYAKA S. R., AND P. S. K. REDDY
P
G ∈ G. This proves the Claim A. Then γdI (S(G, 2)) > 3n − 1 for G ∈
/ G. Hence
P P
γdI ( S (G, 2 )) ⩾ 3n.So, γdI S (G, 2 ) = 3n otherwise. □
P
Remark 3.5. In particular γdI (S (K1,q , 2)) = 3(q + 1 ).
Theorem 2.5. The perfect double Italian domination number of generalised Sier-
P
pinski graph S(G, 2) such that G has at least two universal vertices is γdI (S(G, 2))
= 3n − 1.
Proof. Consider S(G, 2). Let V = {v1 , v2 , . . . vn } be the vertex set of G hav-
ing atleast two universal vertices say, v1 and v2 . Then let {v1 v1 , v2 v1 , . . . vn v1 }
and {v1 v2 , v2 v2 , . . . vn v2 } be the corresponding vertices on each copy of G, say
Gi , i = 1, 2, 3, . . .. in S(G, 2). Since γdI ( S (G, 2 )) ⩽ γdI P
( S (G, 2 )), 3n − 1 ⩽
P
γdI ( S (G, 2 )). Now conversely, consider the function,
1 i ∈ {2, 3, 4, . . . n}, j = 1
f (vi vj ) = 2 i ∈ {2, 3, 4, . . . n}, j = 2, and v1 v1
0 otherwise
4. Conclusion
In this paper we computed the exact value of double Italian and perfect double
Italian domination numbers of generalised Sierpiński graph S(G, 2) and found that
γdI ( S (Cn , 2 )) = n(n −1 ), γdI (S (G, 2 )) = 3n −1 where G has a universal vertex,
(
P 3n − 1 G ∈ G
γdI (S(G, 2)) =
3n otherwise
where, G is the class of graphs with exactly one universal vertex and all other
P
vertices of degree n − 2 and n ≡ 1 ( mod 4 ), for n ⩾ 3 and γdI ( S (G, 2 )) = 3n − 1
if G has at least 2 universal vertices.
References
[1] V. Anu and S. Aparna Lakshmanan, The double Roman domination number of generalized
Sierpiński graphs, Discrete Math Algorithms Appl., 12(4) (2020) 2050047.
[2] V. Anu, A study on two graph parameters - double roman domination number and homo-
metric number, PhD Dissertation (2020).
[3] R. Balakrishnan and K. Ranganathan, A textbook of graph theory, Springer Science &
Business Media, (2012).
[4] G.Hao, P. Jalilolghadr and D.A. Mojdeh, Perfect double Italian domination of a
graph,AKCE Int. J. Graphs Comb., (2023): 1-11.
[5] T.W.Haynes, S. Hedetniemi, and P. Slater, Fundamentals of domination in graphs, CRC
press,( 2013).
[6] T.W.Haynes,Domination in graphs: volume 2: advanced topics,Routledge, (2017).
[7] V. Jismy, V. Anu and S. Aparna Lakshmanan, Domination parameters of generalized
Sierpiński graphs, AKCE Int. J. Graphs Comb., (2022) 1-7.
[8] S. Klavžar,U. Milutinović and C. Petr, 1-perfect codes in Sierpiński graphs,Bull. Aust. Math.
Soc., 66(3) (2002) 369-384.
ON DOMINATION OF SIERPINSKI GRAPHS 9
[9] S.Klavžar and U. Milutinović, Graphs S ( n, k ) and a variant of the Tower of Hanoi problem,
Czechoslov. Math. J.,47 (1997) 95-104.
[10] D.A.Mojdeh and L.Volkmann, Roman {3}-domination (double Italian domination), Discret.
Appl. Math. , 283 (2020) 555-564.
[11] F. Ramezani, E. D. Rodrıguez-Bazan and J. A. Rodrıguez-Velázquez,On the Roman Domi-
nation Number of Generalized Sierpinski Graphs,Filomat,31(20) (2017) 65156528.
[12] J.A.Rodrı́guez-Velázquez, E. D. Rodrı́guez-Bazan and A. Estrada-Moreno, On Generalized
Sierpiński Graphs,Discuss. Math. Graph Theory,37(3) (2017) 547-560.