Work

Bondage Numbers in Power Dominator Coloring of Graphs

Year: 2026
Type: article
Abstract: Power dominator coloring is a strengthened form of graph coloring in which every vertex must be assigned a color and must also be able to power dominate at least one color class. The minimum number of colors required for such a coloring is the power dominator chromatic number, denoted by \(\chi_{pd}(G)\). In this paper, we introduce two stability parameters for \(\chi_{pd}(G)\): the upper bondage number \(b^+(G,\chi_{pd})\) and the lower bondage number \(b^-(G,\chi_{pd})\). These values represent the minimum number of edges whose removal increases or decreases \(\chi_{pd}(G)\), respectively. We compute these bondage numbers for fundamental graph families such as paths \(P_n\), cycles \(C_n\), complete graphs \(K_n\), complete bipartite graphs \(K_{m,n}\), wheel graph \(W_n\) and helm graph \(H_n\). Our results show that the power dominator chromatic number is highly sensitive to small structural modifications, especially in dense graphs like \(K_n\) where the removal of a single edge already reduces the chromatic requirement. For graphs where \(\chi_{pd}=2\), such as paths and even cycles, the lower bondage number is infinite, since it is impossible to reduce the number of colors below two. This work establishes the first bondage-type analysis for power dominator coloring and provides a foundation for further studies on robustness of domination-based colorings.
Language: English
Open Access status: gold
Estimated APC paid: $450
OpenAlex ID: W7234174644
FWCI:
Cites: 9
Cited by:
Related to: 10