On Lucas Product Cordial Labeling of Some Snake Graphs

Abstract: An injective function \( f : V(G) \rightarrow \{L_1, L_2, \ldots, L_n\} \), where \( L_i \) is the \( i \)th Lucas number, is called a Lucas product cordial labeling if the induced function satisfies \( |e_f^*(0) – e_f^*(1)| \leq 1 \). A graph which...

t-Secure Hop Dominating Sets in Graphs

Abstract: Hop domination was introduced as a distance-two analogue of domination and has been studied extensively in recent years. A secure hop dominating set, recently introduced, models a single adversarial attack at an unoccupied vertex (a vertex not in the current...

On Edouard Product Cordial Labeling of Some Graphs

Abstract: Let \( G \) be a graph. An Edouard Product Cordial Labeling (EPCL) of a graph \( G \) with \( |V(G)| = n \) is an injective function \( f : V(G) \rightarrow \{E_0, E_1, E_2, \ldots, E_{n-1}\} \) where \( E_i \) is the \( i \)th Edouard number \( (i =...