@article{MAKHILLJEAS201914117298,
    title = {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>},
    journal = {Journal of Engineering and Applied Sciences},
    volume = {14},
    number = {1},
    pages = {114-119},
    year = {2019},
    issn = {1816-949x},
    doi = {jeasci.2019.114.119},
    url = {https://makhillpublications.co/view-article.php?issn=1816-949x&doi=jeasci.2019.114.119},
    author = {G.C.,P. and},
    keywords = {cardinality,metro dominating set,dominating set,landmark,Metric dimension,product},
    abstract = {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> .}
    }