This analysis determines the outer connected eccentric domination number in selected graphs, suggesting new insights in graph theory.
A Set Doce of V (G) is an Outer Connected Eccentric Set of Dominating, if Doce is an Eccentric Dominating Set of G and in graph V (G) - Doce is connected. An Outer Connected Eccentric Domination Number is the least magnitude of an Outer Connected Eccentric Dominating set and is denoted byγoce. Here we determine an Outer Connected Eccentric Domination number of some certain graphs and also found some stuff of an Outer Connected Eccentric Domination Number.
No takes yet. Share an insight, caveat, or question.
S et al. (2026) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: