Bondage Numbers in Power Dominator Coloring of Graphs

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.

Authors

Institutions

Publication Details

Journal
International Journal of Analysis and Applications
Published
2026-11-16
DOI
https://doi.org/10.28924/2291-8639-24-2026-373
Primary Topic
Advanced Graph Theory Research
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Bondage Numbers in Power Dominator Coloring of Graphs

L. Jacquline, R. Sankar, G. Navamani, L. Panneerselvam et al.
International Journal of Analysis and Applications
Advanced Graph Theory Research
article

Bondage Numbers in Power Dominator Coloring of Graphs

L. Jacquline, R. Sankar, G. Navamani, L. Panneerselvam, M. R. Raghavendra
article en

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.

International Journal of Analysis and ApplicationsVol. 24
Vel Tech Rangarajan Dr. Sagunthala R&D Institute of Science and Technology (IN), SRM Institute of Science and Technology (IN), SRM Dental College (IN), Saveetha University (IN)
Advanced Graph Theory Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon