The ∗∗-closure for graphs and claw-free graphs

A closure concept for undirected graphs based on the structure of the second neighborhood of a vertex is introduced. It is shown that the closure of a graph is uniquely determined and that the closure operation preserves the length of a longest path and cycle. Some related closure concepts are also discussed. A generalization of some known closure concepts is obtained.