Radzkhan B. Berte

2-Distance Certified Independence in the Join of Two Graphs.

Given a simple and undirected graph G=(V(G),E(G)). Then R\subseteq V(G) is called a 2-distance certified independent set of G if R satisfies the following two conditions:(i)For every x\in R, x has either zero or at least two hop neighborhood in V(G)\setminus R; and (ii) R is an independent set of G. The 2-distance cer...

2-Distance Certified Independence in the Join of Two Graphs