Open access
2026
A New Variant of HOP Independence.
Let G=(V(G), E(G)) be a simple and undirected graph. Then P \subseteq V(G) is called a 2-distance certified hop independent set of G if P is a hop independent and for every vertex v in P, v has either zero or at least two hop neighbors in V(G) \setminus P. The 2-distance certified hop independence number of G, denoted...
Javier Hassan, Albenhar Maali, Mercedita A. Langamin et al.
· International Journal of Mat... · 0 citations