TY  - JOUR
T1  - On the Metro Domination Number of Cartesian Product of P<sub>m&#95;</sub>P<sub>n</sub> and C<sub>m&#95;</sub>C<sub>n</sub>
AU - Basavaraju, G.C. AU - Raghunath, P. AU - Vishukumar, M. 
JO  - Journal of Engineering and Applied Sciences
VL  - 14
IS  - 1
SP  - 114
EP  - 119
PY  - 2019
DA  - 2001/08/19
SN  - 1816-949x
DO  - jeasci.2019.114.119
UR  - https://makhillpublications.co/view-article.php?doi=jeasci.2019.114.119
KW  - cardinality
KW  -metro dominating set
KW  -dominating set
KW  -landmark
KW  -Metric dimension
KW  -product
AB  - Let G = (V, E) be a graph. A set S&sube;V is called resolving set if for every u, v&isin;V there exist w&isin;V such
that d(u, w) &ne; = d(v, w). The resolving set with minimum cardinality is called metric basis and its cardinality is
called metric dimention and it is denoted by &beta;(G). A set D&sube;V is called dominating set if every vertex not in D
is adjacent to at least one vertex in D. The dominating set with minimum cardinality is called domination number
of G and it is denoted by &gamma;(G). A set which is both resolving set as well as dominating set is called metro
dominating set. The minimum cardinality of a metro dominating set is called metro domination number of G and
it is denoted by &gamma;&beta;(G). In this study we determine on the metro domination number of cartesian product of P<sub>m</sub> P<sub>n</sub> and C<sub>m</sub> C<sub>n</sub> .
ER  -