IJCOPE Journal

UGC Logo DOI / ISO Logo

International Journal of Creative and Open Research in Engineering and Management

A Peer-Reviewed, Open-Access International Journal Supporting Multidisciplinary Research, Digital Publishing Standards, DOI Registration, and Academic Indexing.
Journal Information
ISSN: 3108-1754 (Online)
Crossref DOI: Available
ISO Certification: 9001:2015
Publication Fee: 599/- INR
Compliance: UGC Journal Norms
License: CC BY 4.0
Peer Review: Double Blind
Volume 02, Issue 05

Published on: May 2026

METRO DOMINATION NUMBER OF CYCLE WITH ONE CHORD

G C Basavaraju N Jyothi

Department of Mathematics

Brindavan College of Engineering Bengaluru Karnataka India

Article Status

Plagiarism Passed Peer Reviewed Open Access

Available Documents

Abstract

A subset D of the vertex set V of the graph G(V,E) is said to be a Dominating set if every vertex in V-D is adjacent to at least one vertex in D. The minimum cardinality of the dominating set is called the domination number. The metro domination number is the order of a minimum dominating set which resolves as a metric set. It is denoted by   In this paper, we determine the Metro Domination number of cycle with one chord.

Keywords- Dominating set, Domination number, Metric dimension, Metro domination.

How to Cite this Paper

Basavaraju, G. C. & Jyothi, N. (2026). Metro Domination Number of Cycle with one Chord. International Journal of Creative and Open Research in Engineering and Management, <i>02</i>(05). https://doi.org/10.55041/ijcope.v2i5.111

Basavaraju, G, and N Jyothi. "Metro Domination Number of Cycle with one Chord." International Journal of Creative and Open Research in Engineering and Management, vol. 02, no. 05, 2026, pp. . doi:https://doi.org/10.55041/ijcope.v2i5.111.

Basavaraju, G, and N Jyothi. "Metro Domination Number of Cycle with one Chord." International Journal of Creative and Open Research in Engineering and Management 02, no. 05 (2026). https://doi.org/https://doi.org/10.55041/ijcope.v2i5.111.

Search & Index

References


  1. Berge, Graphs and hypergraphs, North-Holland, Amsterdam, 1973.

  2. Zmazek and J. Zerovnik, “On domination number of graph bundles”, Institute of mathematics, physics and mechanics, 43(2005), pp. 1-10.

  3. Sugumaran, E. Jayachandran, “Domination number of some graphs”, International Journal of Scientific Development and Research, 3(2018), no. 11, pp. 386-391.

  4. C Basavaraju & Vishukumar M, On the Metro domination number of Cartesian product of path & cycle, Journal of engineering and applied sciences, 14(2019), no.1, pp.114-119.

  5. Slashi Leel and Sweta srivastav, Domonation number in the context of some new graphs, Engineering proceedings 2024,62,14. https://doi.org/3390/ engproc 2024062014.

  6. C Basavaraju & Vishukumar M,On the K-Metro domination number of Cartesian product of paths, Journal of Advanced Research in Dynamical & Control System, 11(2019), no.1, pp.425-431.

  7. C Basavaraju & Rajeswari Shibaraya, Metro domination number of diamond snake graph, International Journal For Research Trends & Innovation, Vol.7, Issue-3

  8. C Basavaraju & Vishukumar M, Metro domination number of powers of path, International Journal of Emerging Technology and Advance Engineering, 8(2017), no.3, pp.539-545.

  9. Vishukumar M & G.C Basavaraju, Metro domination number of square of path, Annals of Pure & Applied Mathematics, 14(2017), no.3, pp.539-545.

Ethical Compliance & Review Process

  • All submissions are screened under plagiarism detection.
  • Review follows editorial policy.
  • Authors retain copyright.
  • Peer Review Type: Double-Blind Peer Review
  • Published on: May 06 2026
CCBYNC

This article is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License. You are free to share and adapt this work for non-commercial purposes with proper attribution.

View License
Scroll to Top