HYPER PATHS AND HYPER CYCLES
Ranjith Dharmarajan, Kishore Kumar Kannan · International Journal of Pure and Apllied Mathematics · 2015
In graphs, paths are walks with no repeated vertex.A fortiori, paths cannot have any repeated edge.But in hypergraphs, hyperedges can repeat in vertex-to-vertex walks without causing repetition of any vertex.This is the crux of the idea of generalizing paths and cycles (from graphs to hypergraphs) presented in this short article.