An efficient dominating set of a circular arc graph corresponding to circular arc family by using induction method
Year: 2026
Type: article
Abstract: In this paper, we consider the concept of efficient dominating set using circular arc graph corresponding to a circular arc family A. The concept of dominating set has every vertex exactly once. An efficient dominating set D⊆V in an interval graph is a dominating set with the additional property that the closed neighbourhood nbd[v] of every vertex v∈V contains exactly one vertex in D. In this Paper, we have presented “The efficient dominating set of a circular arc graph corresponding to circular arc family by induction method”. This is very useful to modelling, a parallel computers, processor and interconnection as a circular arc graph. An efficient dominating set represents an optimal placement of limited resources.
Author: A, Sudhakaraiah
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7170088078
FWCI:
Cites:
Cited by:
Related to: