International Journal of Analysis and Applications ISSN 2291-8639 (Online)

Research Article

Bondage Numbers in Power Dominator Coloring of Graphs

  • L. Jacquline
  • G. Navamani
  • M. R. Raghavendra
  • L. Panneerselvam
  • R. Sankar

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.

How to Cite

L. Jacquline, G. Navamani, M. R. Raghavendra, L. Panneerselvam, R. Sankar, Bondage Numbers in Power Dominator Coloring of Graphs, Int. J. Anal. Appl. 24 (2026), 373. https://doi.org/10.28924/2291-8639-24-2026-373

BibTeX
@article{Jacquline2026,
  author  = {Jacquline, L. and Navamani, G. and Raghavendra, M. R. and Panneerselvam, L. and Sankar, R.},
  title   = {Bondage Numbers in Power Dominator Coloring of Graphs},
  journal = {Int. J. Anal. Appl.},
  volume  = {24},
  year    = {2026},
  pages   = {373},
  doi     = {10.28924/2291-8639-24-2026-373}
}