See discussions, stats, and author profiles for this publication at: https://www.researchgate.

net/publication/337591079

Independent domination in chain silicate networks

Article · November 2019

CITATIONS READS

0 187

2 authors, including:

J. Anitha
Arulmigu Kapaleeswarar Arts and Science College(HR & CE DEPARTMENT) GOVT. OF TAMIL NADU
23 PUBLICATIONS   18 CITATIONS   

SEE PROFILE

Some of the authors of this publication are also working on these related projects:

Total domination in fully connected cubic networks View project

All content following this page was uploaded by J. Anitha on 28 November 2019.

The user has requested enhancement of the downloaded file.

Journal of International Pharmaceutical Research, ISSN: 1674-0440

Available at http://ijprjournals.com/abstractt.php?id=342

Independent domination in chain silicate networks

V. Suganya1 and J. Anitha2*

1. Research Scholar, Department of Mathematics, Vels Institute of Science, Technology Advanced Studies, Chennai.
India. 2. Assistant Professor, Department of Mathematics, Vels Institute of Science, Technology Advanced Studies,
Chennai. India
Correspondence author: J. Anitha, e-mail: anithaharish78@gmail.com
Received: 05-01-2019, Revised: 24-01-2019, Accepted: 22-02-2019, Published online: 04-04-2019

How to cite this article: V. Suganya and J. Anitha (2019) Independent domination in chain silicate networks, Journal of
International Pharmaceutical Research 46(1): 384-387

Abstract
A set 𝑆 ⊆ 𝑉is a dominating set in 𝐺(𝑉, 𝐸) if every vertex in 𝑉not in 𝑆has atleast one neighbour in 𝑆. The
domination number of 𝐺, denoted by 𝛾(𝐺), is the minimum cardinality of a dominating set of 𝐺. A set 𝑆of
vertices in a graph 𝐺is an independent dominating set of G if S is both an independent set and a dominating set
of 𝐺. The independent domination number 𝑖(𝐺) of a graph 𝐺is the minimum cardinality of an independent
dominating set in 𝐺. In this paper, we obtain independent domination number for chain silicate networks and
cyclic silicate networks. Further, we shown that equal domination number and independent domination number
for chain silicate networks and cyclic silicate networks.
Keywords: Dominating Set, Independent Dominating Set, Chain Silicate Network, Cyclic Silicate Network.
AMS Classification: 05C69, 05C76

Introduction
The domination in graphs is one of the concepts in
graph theory which has attracted many researchers to
work on it because it has the potential to solve many
real life problems involving design and analysis of
communication network as well as defense
surveillance. Many variants of domination models are
available in the existing literature such as independent
domination, total domination, connected domination,
edge domination and so on. In this paper, we solve
independent domination number for chain silicate
networks and cyclic silicate networks. Independent
sets play an important role in graph theory and other
area like discrete optimization.
The concept of an independent dominating set
initiated in chessboard problems. In 1862 , de Jaenisch
posed the problem of finding the minimum number of
mutually non-attacking queens that can be placed on a
chessboard so that each square of the chessboard is
attacked by at least one of the queens. A graph Gmay
be formed from an 88 chessboard by taking the
squares as the vertices with two vertices adjacent if a
queen situated on one square attacks the other square.
The graph G is known as the queens graph. The
minimum number of mutually non-attacking queens
that attack all the squares of a chessboard is the
independent domination number i(G). Independent
dominating set also used in matching theory, coloring
of graphs and in the theory of trees[1].
The theory of independent domination was
formalized by Berge [2] and Ore in 1962 [3]. The
independent domination number and the notation i(G)
were introduced by Cockayne and Hedetniemi [4, 5].
Independent dominating sets in regular graphs and in
cubic graphs in particular, are well studied in Goddard
et al. [6], Kostichka [7] and Lam et al. [8]. Favaron
[9] initiated the quest of finding sharp upper bounds
for independent domination number in general graphs,
as functions of n and δ. This work was extended by
Haviland [10]. Cockayne et al. [11] obtained the upper
bound for the product of the independent domination
numbers of a graph and its complement while Shiu et
al. [12] found the upper bounds for the independent
domination number of triangle-free graphs and also
characterized the extremal graphs achieving these
upper bounds. Allan and Laskar [13] discussed the
graphs with equal domination and independent
domination numbers while Southey and Henning [14]
considered the ratio of the independent domination
number versus the domination number in a cubic
graph and also characterized the graphs achieving this
ratio of 4/3. Ao et al. [15] proved that for each k ≥ 4,
there exists a connected k−domination critical graph
with independent domination number exceeding k.
Definition 1. [16] For 𝑣 ∈ 𝑉 (𝐺) , the open
neighbourhood of 𝑣, denoted as 𝑁𝐺 (𝑣), is the set of
vertices adjacent with 𝑣 ; and the closed
neighbourhood of 𝑣 , denoted by 𝑁𝐺 [𝑣] , is
𝑁𝐺 (𝑣) {𝑣} . For a set 𝑆 ⊆ 𝑉 (𝐺) , the open

Journal of International Pharmaceutical Research, ISSN: 1674-0440 384

 Available at http://ijprjournals.com/abstractt.php?id=342
neighbourhood of 𝑆 is defined as 𝑁𝐺 𝑆 =
𝑣𝜖𝑆 𝑁𝐺 𝑣 and theclosed neighbourhood of 𝑆 is
defined as𝑁𝐺 𝑆 = 𝑁𝐺 𝑆 𝑆 For brevity, we denote
𝑁𝐺 𝑆 by 𝑁 𝑆 and 𝑁𝐺 𝑆 by 𝑁[𝑆].
Definition 2. [16]For a graph 𝐺(𝑉, 𝐸), 𝑆 ⊆ 𝑉 is a
dominating set of 𝐺 if every vertex in 𝑉 \𝑆 has at least
one neighbour in 𝑆 . The domination number of 𝐺 ,
denoted by γ(G), is the minimum cardinality of a
dominating set of 𝐺.
Definition 3. [17] An independent set in a graph 𝐺
is a set of pairwise non-adjacent vertices of 𝐺. A set 𝑆
of vertices in a graph 𝐺 is called an independent
dominating set if 𝑆 is both an independent set and a
dominating set of 𝐺 . The independent domination
number 𝑖(𝐺) of a graph 𝐺 is the minimum cardinality
of an independent dominating set in 𝐺.
Main Results
In this section, we solve the domination number
and the independent domination number for certain
silicate networks such as chain silicate and cyclic
silicate networks.
Independent Domination in Silicate Structures
The silicates are the largest, the most interesting
and the most complicated class of minerals by far. The
basic chemical unit of silicates is the 𝑆𝑖𝑂4 tetrahedron.
A silicate sheet is a ring of tetrahedrons which are
linked by shared oxygen nodes to other rings in a two
dimensional plane that produces a sheet-like structure.
Silicates are obtained by fusing metal oxides or metal
carbonates with sand. Essentially all the silicates
contain 𝑆𝑖𝑂4 tetrahedra. In chemistry, the corner
vertices of 𝑆𝑖𝑂4 tetrahedron represent oxygen ions and
the center vertex represents the silicon ion. In graph
theory, we call the corner vertices as oxygen nodes
and the center vertex as silicon node [18]. See Figure
1.
Figur-1: Si4 tetrahedra
Chain Silicate
A chain silicate network of dimension n, denoted
by 𝐶𝑆𝑛 , is obtained by arranging n tetrahedra linearly.
It can be readily seen that the number of vertices of
Journal of International Pharmaceutical Research, ISSN: 1674-0440
𝐶𝑆𝑛 , 𝑛 ≥ 1, is 3𝑛 + 1 and the number of edges is
6𝑛. A chain silicate network of dimension 𝑛, denoted
by 𝐶𝑆𝑛 , is obtained by arranging 𝑛tetrahedra linearly.
It can be readily seen that the number of vertices of
𝐶𝑆𝑛 , 𝑛 ≥ 1, is 3𝑛 + 1 and the number of edges is
6𝑛[18]. See Figure 3.
Lemma 1. Let 𝐻 be a twin 𝐾4 graph as shown in
Figure 2. Then𝛾(𝐻) = 1.
Proof. Let 𝑆be a dominating set of 𝐺. We claim
that |𝑆| = 1. Suppose 𝐻do not contain any member
of 𝑆. Even if, the vertices of 𝐻say, 𝑢𝑖 , 𝑖 = 1,2,3,4 are
dominated by 𝑆 not in 𝐻 then the vertices in 𝐻 say,
𝑣𝑖 , 𝑖 = 1,2,3 do not dominate by any member of 𝑆.
See Figure 2. To dominate the vertices in 𝐻say, 𝑣𝑖 ,
𝑖 = 1,2,3 we need to include at least one vertex of
𝑆in 𝐻. Therefore, γ(H) = 1.
Lemma 2. Let 𝐺 be a chain silicate network 𝐶𝑆𝑛 ,n
𝑛
even. Then.𝛾 𝐺 ≥ .
2
𝑛
Proof. In 𝐶𝑆𝑛 , 𝑛 ≥ 2 , there are copies of
2
twin𝐾4 ’s as described in Lemma 1. Therefore,
𝑛
𝛾 𝐺 ≥ .
2
Figure-2: TwinK4
The Algorithm given below computes the
independent domination number in chain silicate
network 𝐶𝑆𝑛 .
Independent Domination Algorithm in chain
silicate network 𝑪𝑺𝒏 Input: Let 𝐺be the chain silicate
network 𝐶𝑆𝑛 ,𝑛even.
Algorithm
(i) Transform each 𝐾4 in the chain silicate 𝐶𝑆𝑛 as a
vertex and join two vertices if the corresponding 𝐾4 ’s
share a common vertex. The resulting graph is a path
𝑃𝑛 . See Figure 5. (ii) Label the vertices of path 𝑃𝑛 as
𝑣1, 𝑣2 , … , 𝑣𝑛, and edges as 𝑒1 , 𝑒2 , . . . , 𝑒𝑛−1 from left to
right.
(iii) Select 𝑆 = {𝑒𝑖 }, 𝑖 = 1,3,5, . . . , 𝑛 − 1. Edges
in 𝑆 represents the common vertex in the
corresponding chain silicate 𝐶𝑆𝑛 .
385
 Available at http://ijprjournals.com/abstractt.php?id=342
𝑛
Output: 𝑖 𝐺 = . Lemma 4. Let 𝐺 be a cyclic silicate network 𝐶𝐶𝑛 ,
2 𝑛
𝑛 even. Then𝛾 𝐺 ≥ .
2
𝑛
Proof. In 𝐶𝐶𝑛 n, 𝑛 ≥ 2, there are copies of twin
2
𝐾4 ′s as described in Lemma 1. Therefore,
𝑛
𝛾 𝐺 ≥ .
2
The Algorithm given below computes the
independent domination number in cyclic
Figure-3: (a) Circled vertices constitutes a silicate network 𝐶𝑆𝑛 .
independent dominating set of Chain Silicate 𝐶𝑆6
Proof of correctness: Let 𝑆 be the set of edges Independent Domination Algorithm in cyclic
labeled as 𝑒1 , 𝑒3 , . . . , 𝑒𝑛−1 in Figure 3(b) represents the silicate network 𝐶𝑆𝑛 Input: Let 𝐺 be the cyclic
common vertex in the corresponding chain silicate silicate network 𝐶𝐶𝑛 , 𝑛even.
𝐶𝑆𝑛 . To prove each vertex in 𝐶𝑆𝑛 is dominated, it is Algorithm
sufficient to prove that the vertices considered in (i) Transform each 𝐾4 in the cyclic silicate 𝐶𝐶𝑛 ,as a
𝑆 dominates the two copies of 𝐾4 . By Lemma 1, vertex and join two vertices if the corresponding 𝐾4 ’s
domination number of twin 𝐾4 is one. In 𝐶𝑆𝑛 , there share a common vertex. The resulting graph is cycle
𝑛
are twin𝐾4 ’s. Moreover, it is possible to take pairwise 𝐶𝑛 . See Figure 6. (ii) Label the vertices of cycle 𝐶𝑛 as
2
𝑛
non-adjacent vertices which can dominates the 𝑣1, 𝑣2 , … , 𝑣𝑛, and edges as 𝑒1 , 𝑒2 , . . . , 𝑒𝑛 from clockwise
2 direction.
𝑛
vertices of 𝐶𝑆𝑛 . Therefore, 𝑆 = . This implies
2 (iii)Select 𝑆 = {𝑒𝑖 }, 𝑖 = 1,3,5, . . . , 𝑛 − 1 . Edges
𝑛
that,𝑖 𝐺 = . in 𝑆 represents the common vertex in the
2
corresponding cyclic silicate 𝐶𝐶𝑛 .
𝑛
Output: 𝑖 𝐺 = .
2
(a)
Figure-4: Path P6 v1
e8 e1
Theorem 3. Let 𝐺 be the 𝐶𝑆𝑛 , 𝑛 even. Then γ 𝐺 =
𝑛 v8 v2
𝑖 𝐺 = .
2
Cyclic Silicates
A cyclic silicate of dimension 𝑛, denoted by 𝐶𝐶𝑛 , e7 e2
is obtained by connecting 𝑛 tetrahedra into a cyclic
structure. The numbers of vertices and edges of 𝐶𝐶𝑛 ,
𝑛 ≥ 3, are 3𝑛and 6𝑛respectively [18]. See Figure 5 v7 v3

e6 e3

v6 v4
e5 e4
v5
Figure-6: Cycle C6
Proof of correctness: Let 𝑆 be the set of edges
labeled as 𝑒1 , 𝑒2 , . . . , 𝑒𝑛−1 in Figure 4(b) represents the
common vertex in the corresponding cyclic silicate
𝐶𝐶𝑛 . To prove each vertex in 𝐶𝐶𝑛 is dominated, it is
sufficient to prove that the vertices considered in
𝑆 dominates the two copies of 𝐾4 . By Lemma 1,
domination number of twin 𝐾4 is one. In 𝐶𝐶𝑛 , there
𝑛
Figure-5: Cyclic Slicate 𝐶𝐶6 are twin 𝐾4 ’s. Moreover, it is possible to take
2
𝑛
pairwise non-adjacent vertices which can dominates
2

Journal of International Pharmaceutical Research, ISSN: 1674-0440 386

 Available at http://ijprjournals.com/abstractt.php?id=342
𝑛 17. Vaidya, S. K., and Pandit, R. M. (2016). Independent
the vertices of 𝐶𝐶𝑛 . Therefore, 𝑆 = . This implies
2 Domination in Some Wheel Related Graphs. Applications
𝑛
that, 𝑖 𝐺 = . and Applied Mathematics, 11: 397-407.
2
18. Prabhu, S., Arulmozhi, A. K., and Arulperumjothi, M.
Theorem 5.Let 𝐺 be the cyclic silicate network (2018). On Power Domination in Certain Chemical
n Graphs. International Journal of Pure and Applied
𝐶𝐶𝑛 , 𝑛 ≥ 2. Then γ G = i G = . Mathematics, 118(11): 11-19.
2

Conclusion

In this paper, we obtained domination number and

independent domination number for chain silicate
networks and cyclic silicate networks. Further, we
shown that domination number and independent
domination number are equal for chain silicate
networks and cyclic silicate networks.

References
1. Hedetniemi, S. T., and Laskar, R. C. (1991). Bibliography
on domination in graphs and some basic definitions of
domination parameters. Annals of Discrete Mathematics,
48: 257-277.
2. Berge. C. Theory of Graphs and its Applications, Methuen,
London, 1962.
3. Ore, O. (1962). Theory of graphs. Amer. Math. Soc.
Transl., 38: 206-212.
4. Cockayne, E. J. and Hedetniemi, S.T. (1974). Independent
graphs. Congr. Numer., 10: 471-491.
5. Cockayne, E.J. and Hedetniemi, S.T. (1977). Towards a
theory of domination in graphs. Networks 7: 247-261.
6. Goddard, W., Henning, M., Lyle, J., and Southey. J.
(2012). On the independent domination number of regular
graphs. Ann. Comb., 16: 719-732.
7. Kostochka, A.V. (1993). The independent domination
number of a cubic 3-connected graph can be much larger
than its domination number. Graphs Combin., 9: 235-237.
8. Lam, P. Shiu, W. and Sun, L. (1999). On independent
domination number of regular graphs. Discrete
Mathematics Combin, 202: 135-144.
9. Favaron, O. (1988). Two relations between the parameters
of independence and irredundance, Discrete Math., 70:
17-20.
10. Haviland, J. (2007). Upper bounds for independent
domination in regular graphs, Discrete Math., 307:
2643-2646.
11. Cockayne, E. J., Favaron, O., Li, H., and MacGillivray, G.
(1991). The product of the independent domination
numbers of a graph and its complement. Discrete
mathematics, 90(3): 313-317.
12. Shiu, W. C., Chen, X. G., and Chan, W. H. (2010).
Triangle-free graphs with large independent domination
number. Discrete Optimization, 7(1-2): 86-92.
13. Allan, R. B., and Laskar, R. (1978). On domination and
independent domination numbers of a graph. Discrete
mathematics, 23(2): 73-76.
14. Southey, J., and Henning, M. A. (2013). Domination
versus independent domination in cubic graphs. Discrete
Mathematics, 313(11): 1212-1220..
15. Ao, S., Cockayne, E. J., MacGillivray, G., and Mynhardt,
C. M. (1996). Domination critical graphs with higher
independent domination numbers. Journal of Graph
Theory, 22(1): 9-14.
16. Haynes, T. W., Hedetniemi, S. M., Hedetniemi, S. T., and
Henning, M. A. (2002). Domination in graphs applied to
electric power networks. SIAM Journal on Discrete
Mathematics, 15(4): 519-529.

Journal of International Pharmaceutical Research, ISSN: 1674-0440 387

View publication stats