IJPAM: Volume 98, No. 3 (2015)
Department of Mathematics
Thanjavur, Tamilnadu State, INDIA
Abstract. 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.
Received: April 26, 2014
AMS Subject Classification: 05C12, 05C38, 05C65
Key Words and Phrases: hypergraph, hyperedge, adjacency, path, cycle
Download paper from here.
DOI: 10.12732/ijpam.v98i3.2 How to cite this paper?
Source: International Journal of Pure and Applied Mathematics
ISSN printed version: 1311-8080
ISSN on-line version: 1314-3395
Pages: 309 - 312