• Parashree Pandya
• Nirav B. Vyas

The set of edges with no common end vertex is called a matching. A matching is perfect if every vertex of the graph is incident to an edge of the matching. The subset of vertex set of a graph is a paired dominating set if it is dominating and subgraph induced by the set contains a perfect matching. The paired domination number γ_pr is the cardinality of a minimum paired dominating set for a graph. And the set with minimum cardinality is known as minimum paired dominating set. Let a subset D of the vertex set V(G) be the minimum paired dominating set for the graph G. If the set V(G)-D contains a paired dominating set D^' of the graph G, then D^' is an inverse paired dominating set with respect to D. The inverse paired domination number γ_pr^(-1) (G) is the minimum cardinality of an inverse paired dominating set. The present paper is aimed to report some results and investigations in the context of inverse paired dominating sets in wheel related graphs.

Paired domination, Inverse paired domination, Wheel related graphs

"Paired and Inverse Paired Domination Number of Wheel Related Graphs", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.12, Issue 12, page no.250-257, December-2025, Available :http://www.jetir.org/papers/JETIRHE06031.pdf

"Paired and Inverse Paired Domination Number of Wheel Related Graphs", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.12, Issue 12, page no. pp250-257, December-2025, Available at : http://www.jetir.org/papers/JETIRHE06031.pdf