HYPER PATHS AND HYPER CYCLES

R. Dharmarajan, K. Kannan
2015 International Journal of Pure and Applied Mathematics  
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.
doi:10.12732/ijpam.v98i3.2 fatcat:li7iem7vc5c7dpvfpchxvgy55u