Geoffrey Atkinson

Learn More
Let graph G = (V, E) and integer b ≥ 1 be given. A set S ⊆ V is said to be b-independent if u, v ∈ S implies d G (u, v) > b where d G (u, v) is the shortest distance between u and v in G. The b-independence number α b (G) is the size of the largest b-independent subset of G. When b = 1 this reduces to the standard definition of independence number. We study(More)
  • 1