ON DOMINATION IN COARSE DEG-CENTRIC GRAPHS
Abstract
The coarse deg-centric graph of a graph $G$, denoted by $G_{cd}$, is the graph with $V(G_{cd}) = V(G)$ and$E(G_{cd}) = \{v_iv_j: d_G(v_i,v_j) > deg_G(v_i)\}$.This transformation of the graph is called coarse deg-centrication of the graph. In this paper, we study the domination and domination number of coarse deg-centric graphs. Furthermore, we explore their fundamental properties and structural characteristics, offering insights into their behavior under various graph operations. Received: May 12, 2025Revised: January 7, 2026Accepted: February 13, 2026
Fields of Study & Subjects
Advanced Graph Theory Research
Interconnection Networks and Systems
Graph theory and applications
Publication details
- Journal / source
- Advances and Applications in Discrete Mathematics
- Publisher
- Pushpa Publishing House
- Volume
- 43
- Issue
- 3
- Pages
- 321–326
- Publication date
- 6 April 2026