Inverse Power Domination Problems on Graph Operators and Its Applications

The observation problem in electrical networks was one of the earliest applications of power domination and has since developed into an important topic in graph theory. The inverse power domination number of a graph has received comparatively limited attention across different graph families, particularly in relation to the classical power domination number and graph operators. This paper presents a systematic investigation of the inverse power domination problem for several well-known graph operators, including the Cartesian product, corona product, line graph, subdivision graph, and total graph, and derives exact results for common graph families such as paths, cycles, complete graphs, stars, wheel graphs, the Petersen graph, hypercubes, and complete bipartite graphs. Mathematically, the problem can be interpreted as identifying an efficient alternative monitoring configuration when a primary monitoring configuration is no longer available. An inverse power dominating set ????′of a graph ????, with respect to a power dominating set ????, is a subset of ????(????) ∖???? such that ????′is also a power dominating set of ????. The inverse power domination number ????????−1(????)is the minimum cardinality of such a set. We obtain tight lower and upper bounds for this parameter for the graph operators and families considered, provide corresponding proofs and graph-based illustrations, and examine the relationship between ????????−1(????)and other classical domination parameters. These findings provide a quantitative framework for comparing network structures in terms of primary and secondary monitoring requirements and establish a connection between graph-theoretic properties, resource allocation, and redundancy decisions. Beyond the theoretical analysis, the study considers applications in smart power-grid monitoring, fault-tolerant network design, IoT sensor deployment, and cybersecurity. The inverse power domination framework provides mathematical decision support for selecting backup monitoring locations, maintaining network observability, and evaluating redundancy requirements under primary-system failure. The results contribute to domination theory and strengthen the relevance of graph operators to resilient network design and mathematical decision-making.

Authors

Institutions

Publication Details

Journal
Computer and decision making.
Published
2026-11-13
DOI
https://doi.org/10.1922/comdem.v4i1.19082
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

Inverse Power Domination Problems on Graph Operators and Its Applications

Geeta Kameri, Vijay Teli, Mahantesh Kodabagi, Satish Hande
Computer and decision making.
Advanced Graph Theory Research
article

Inverse Power Domination Problems on Graph Operators and Its Applications

Geeta Kameri, Vijay Teli, Mahantesh Kodabagi, Satish Hande
article en

Abstract

The observation problem in electrical networks was one of the earliest applications of power domination and has since developed into an important topic in graph theory. The inverse power domination number of a graph has received comparatively limited attention across different graph families, particularly in relation to the classical power domination number and graph operators. This paper presents a systematic investigation of the inverse power domination problem for several well-known graph operators, including the Cartesian product, corona product, line graph, subdivision graph, and total graph, and derives exact results for common graph families such as paths, cycles, complete graphs, stars, wheel graphs, the Petersen graph, hypercubes, and complete bipartite graphs. Mathematically, the problem can be interpreted as identifying an efficient alternative monitoring configuration when a primary monitoring configuration is no longer available. An inverse power dominating set ????′of a graph ????, with respect to a power dominating set ????, is a subset of ????(????) ∖???? such that ????′is also a power dominating set of ????. The inverse power domination number ????????−1(????)is the minimum cardinality of such a set. We obtain tight lower and upper bounds for this parameter for the graph operators and families considered, provide corresponding proofs and graph-based illustrations, and examine the relationship between ????????−1(????)and other classical domination parameters. These findings provide a quantitative framework for comparing network structures in terms of primary and secondary monitoring requirements and establish a connection between graph-theoretic properties, resource allocation, and redundancy decisions. Beyond the theoretical analysis, the study considers applications in smart power-grid monitoring, fault-tolerant network design, IoT sensor deployment, and cybersecurity. The inverse power domination framework provides mathematical decision support for selecting backup monitoring locations, maintaining network observability, and evaluating redundancy requirements under primary-system failure. The results contribute to domination theory and strengthen the relevance of graph operators to resilient network design and mathematical decision-making.

Computer and decision making.Vol. 4(1)
Ajeenkya DY Patil 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