Professional Documents
Culture Documents
2018 IJPAMOn Power Dominationin Certain Chemical Graphs
2018 IJPAMOn Power Dominationin Certain Chemical Graphs
net/publication/324899737
CITATIONS READS
6 268
3 authors:
M. Arulperumjothi
SAVEETHA ENGINEERING COLLEGE
30 PUBLICATIONS 158 CITATIONS
SEE PROFILE
Some of the authors of this publication are also working on these related projects:
All content following this page was uploaded by Savari Prabhu on 19 October 2018.
Abstract
A set S ⊆ V is a dominating set in G(V, E) if every
vertex in V not in S has atleast one neighbour in S. The
domination number of G, denoted by γ(G) , is the mini-
mum cardinality of a dominating set of G. A subset S ⊆ V
is a power domination set of G if all vertices of V can be
observed recursively by the following rules: (i) All vertices
in N [S] are observed initially, and (ii) if an observed vertex
u has all neighbours observed expect one neighbour v, then
v is observed by u.
11
International Journal of Pure and Applied Mathematics Special Issue
1 Introduction
An electric power network consists of electrical nodes (loads and
generators) an transmission lines joining the electrical nodes. Elec-
tric power companies need to monitor the state of their network
continually. Voltage magnitude at loads and machine phase at gen-
erators must be monitored. Variables are voltage and machine.
These has to be monitored by placing (PMUs) Phase measurement
units at selected location in the system. Because of the high cost of
PMUs, it is important to minimize the number of PMU used while
still maintaining the ability of monitoring the entire system. This
problem is formulated as a graph theoretical problem by Haynes et.
al [6] and named as power domination problem.
Let G(V, E) be a graph. A set S ⊆ V is a dominating set in
G(V, E) if every vertex in V not in S has atleast one neighbour in
S. The domination number of G, denoted by γ(G), is the minimum
cardinality of a dominating set of G.
Let G be a connected graph and S a subset of its vertices. Then
we denote the set observed by S with M (S) and define it recursively
as follows:
1. (Domination)
M (S) ← S ∪ N (S)
2. (Propagation)
As long as there exists v ∈ M (S) such that
(V (G) − M (S)) ∩ N (v) = {w}
set M (S) ← M (S) ∪ {w}
12
International Journal of Pure and Applied Mathematics Special Issue
Oxygen ion
Silicon ion
13
International Journal of Pure and Applied Mathematics Special Issue
n =1 n=3 n=5
Step 4: For every edge selected in Step 3, take the common vertex
in the corresponding chain silicate CSn and collect it in D.
14
International Journal of Pure and Applied Mathematics Special Issue
u3
v3
u2
v2 u4
v1
u1
Figure 3: Twin K4
15
International Journal of Pure and Applied Mathematics Special Issue
4 Conclusion
In this paper we find the power domination number of chain sili-
cates and cyclic silicates. The problem of finding power domination
number for Dominated silicate network is under investigation.
References
[1] R. Barrera, D. Ferrero, Power domination in cylinders, tori,
and generalized Petersen graphs, Networks 58 (2011) 43–49.
16
International Journal of Pure and Applied Mathematics Special Issue
[2] D.J. Brueni, L.S. Heath, The PMU placement problem, SIAM
J. Discrete Math. 19 (2005) 744–761.
[7] W.K. Hon, C.S. Liu, S.L. Peng, C.Y. Tang, Power domination
on block-cactus graphs, in: The 24th Workshop on Combina-
torial Mathematics and Computation Theory, 2007.
[8] K.H. Kao, J.M. Chang, Y.L. Wang, S.H. Xu, J.S.T. Juan,
Power Domination in Honeycomb Meshes, Journal of Informa-
tion Science and Engineering, 29 (2013) 1249–1263.
[9] C.S. Liao, D.T. Lee, Power domination in graphs, in: Com-
puting and Combinatorics, in: Lect. Notes Comput. Sci. 3595
(2005) 818–828.
[11] K.J. Pai, J.M. Chang, Y.L. Wang, A simple algorithm for solv-
ing the power domination problem on grid graphs, in: Proc.
the 24th Workshop Combin. Math. and Comput. Theory, 2007,
256–260.
17
International Journal of Pure and Applied Mathematics Special Issue
[15] G.J. Xu, L.Y. Kang, E.F. Shan, M. Zhao, Power domination
in block graphs, Theor. Comput. Sci. 359 (2006) 299–305.
18
19
20