Distinguishing Numbers for Cartesian Powers and Wreath Products

Abstract: The distinguishing number is an important invariant used to measure the extent to which symmetries of graphs and permutation group actions can be broken by vertex labelings. In this paper, we investigate distinguishing labelings arising from permutation...

Interior hop Roman dominating function in graphs

Abstract: Let \( G = (V(G), E(G)) \) be a simple non-complete graph and let \( \xi : V \rightarrow \{0,1,2\} \) be a hop Roman dominating function (HRDF) on \( G \). For each \( j \in \{0,1,2\} \), let \( V_j = \{x \in V(G) : \xi(x) = j\} \). Then \( \xi = (V_0, V_1,...
Social media & sharing icons powered by UltimatelySocial