Pattarawan Singavananda

On 3-Distance Independent Sets of Graphs.

Let G be a graph with vertex set V(G) and edge set E(G). A set S \subseteq V(G) is a 3-distance independent set of G if d_G(v,w) \neq 3 for any two distinct vertices v,w \in S. The maximum cardinality of a 3-distance independent set of G, denoted by \alpha^3(G), is called the 3-distance independence number of G. In thi...