Copyright © 2025 Authors retain the copyright of this article. This article is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

@article{175311,
        author = {P. Poojitha and Prof. A. Sudhakaraiah and Associate Prof. Dr. G. V. Ramesh Babu},
        title = {Connected Network Dominating Set of a Circular arc graphs},
        journal = {International Journal of Innovative Research in Technology},
        year = {2025},
        volume = {11},
        number = {11},
        pages = {2580-2586},
        issn = {2349-6002},
        url = {https://ijirt.org/article?manuscript=175311},
        abstract = {A graph is a circular arc graph corresponding to circular arc family if it is the intersection graph of a finite set of arcs on a circle. The connected dominating sets are useful in the computation of rooting for mobile networks and circuit networks. A connected dominating set is used as a backbone for communications and vertices that are not in this set communicate by passing message through neighbors that are in the set. Resent advances in technology have made possible the creation of wireless sensor network. Although there is no physical backbone infrastructure a virtual backbone can be formed by constructing a connected dominating set. In this paper we have presented connected network dominating set of a circular arc graph using an algorithm.},
        keywords = {Circular arc family, circular arc graph, dominating set, connected dominating set, network},
        month = {April},
        }