On the k-metro domination number of cartesian product of C3 x Cn

Authors

  • G C Basavaraju Dept of Mathematics, Brindavan College of Engineering, Bangalore.
  • Praveen B M Director, Research & Innovation Council, Srinia University, Mangalore.
  • Yogalashmi S Dept of Mathematics, Atria institute of technology, Bangalore.
  • Vishukumar M Dept of Mathematics, REVA University, Bangalore.

Keywords:

Distance matrix, metric dimension, Land mark, Dominating set, Metro dominating set, K-Dominating set

Abstract

A dominating set D of a graph G = G(V, E) is called metro dominating set  if for every pair of vertices  u, v  there exists a vertex  w in D such that “d(u,w) ≠ d(v, w). The ”-metro domination number of Cartesian product of C3 x Cn (ꝩβk (C3 x Cn)), is the order of smallest   -dominating set of C3 x Cn which resolves as a metric set. In this paper we determine -metro domination number of Cartesian product of C3 x Cn.

Downloads

Download data is not yet available.

References

Buckley and Harary, Distance in Graph Addison-Wesley.1990.

Harary and Melter R A, On the metric dimension of graph, Ars Combinatoria 2(1976).191-195.

Raghunath P and Sooryanarayana B, Metro Domination number of graphs, Twentieth annual conference of Ramanujan Mathematics Society, 25-30(2005) University of Calicut, Calicut.

Basavaraju G C, Vishu Kumar M and Raghunath P, On the metro domination number of Cartesian product of paths and cycles, Journal of Engineering and Applied Sciences, Vol:14(1).114-119, 2019@Medwell Journals.

Jacobson M S and Kinch L F, On the domination number of Cartesian product of graphs I, Ars Combin.18(1983),33-44.

Sandi Klavzar and Norbert Seifter, Dominating Cartesian product of cycles, Disc.Applied Mathematics, 59(1995),129-136.

Lakshminarayana S and Vishu Kumar M, On the K-metro domination number of paths, Annals of Pure and Applied Mathematics, Vol:14, No:3,2017, 593-600.

Vizing V G, The Cartesian product of graphs, vychisl.sistemy.9(1963),30-43.

Basavaraju G C, Vishu Kumar M and Rahunath P, On the K-metro domination number of Cartesian product of paths, Journal of Advanced Research in Dynamical and Control Systems, Vol:11, Issue 1, 2019.

Sandi Klavzar and Norbert Seifter, Dominating Cartesian product of cycles, Disc.Applied Math 59(1995)129-136.

Published

18-10-2022

How to Cite

Basavaraju, G. C., Praveen, B. M., Yogalashmi, S. ., & Vishukumar, M. (2022). On the k-metro domination number of cartesian product of C3 x Cn. International Journal of Health Sciences, 6(S9), 3778–3782. Retrieved from https://sciencescholar.us/journal/index.php/ijhs/article/view/13468

Issue

Vol. 6 No. S9 (2022)

Section

Peer Review Articles
Copyright & Licensing

Copyright (c) 2022 International journal of health sciences

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Articles published in the International Journal of Health Sciences (IJHS) are available under Creative Commons Attribution Non-Commercial No Derivatives Licence (CC BY-NC-ND 4.0). Authors retain copyright in their work and grant IJHS right of first publication under CC BY-NC-ND 4.0. Users have the right to read, download, copy, distribute, print, search, or link to the full texts of articles in this journal, and to use them for any other lawful purpose.

Articles published in IJHS can be copied, communicated and shared in their published form for non-commercial purposes provided full attribution is given to the author and the journal. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.

This copyright notice applies to articles published in IJHS volumes 4 onwards. Please read about the copyright notices for previous volumes under Journal History.