1 citations · 2 across the 4 of their papers we have counts for
4 papers
Certain Domination Parameters and its Resolving Version of Fractal Cubic Networks
S. Prabhu, A. K. Arulmozhi, M. Arulperumjothi
Networks are designed to communicate, operate and allocate the tasks to the respective commodities. Operating the supercomputers became challenging, and it was handled by the netwo…
Power Domination and Resolving Power Domination of Fractal Cubic Network
S. Prabhu, A. K. Arulmozhi, Michael A. Henning +1
In network theory, the domination parameter is vital in investigating several structural features of the networks, including connectedness, their tendency to form clusters, compact…
Twin Vertices in Fault-Tolerant Metric Sets and Fault-Tolerant Metric Dimension of Multistage Interconnection Networks
S. Prabhu, V. Manimozhi, M. Arulperumjothi +1
A set of vertices is a basis or resolving set of a graph if for each there is a vertex such that . A basis is a…
Independent Domination in Directed Graphs
Michael Cary, Jonathan Cary, Savari Prabhu
In this paper we initialize the study of independent domination in directed graphs. We show that an independent dominating set of an orientation of a graph is also an independent d…