Answers are grounded in this paper and cite their sources.
Domination number and Bondage number are important parameters in graph theory that Characterize dominating structures and the effect of edge removal on domination respectively. Circular arc graphs are intersection graphs generated by families of arcs on a circle and exhibit structural properties that provide a useful setting for studying these parameters. In this paper, we investigate the domination number and bondage number of circular arc graphs by examining the relationships between the arrangements of arcs and the adjacency structure of the corresponding graphs. We establish results concerning dominating sets and analyze how the deletion of suitable edges can affect the domination number. Particular attention is given to connected and consecutive circular arc structures, together with structural conditions involving vertex degree. Based on this property, we derive formulas for the selected circular arc graphs. In this paper we have presented “The domination number and bondage number of circular arc graphs with different types of circular arc families of “A”
No takes yet. Share an insight, caveat, or question.
Sudhakaraiah et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: