Creating and Computing Graphs from Hypergraphs
Kragujevac Journal of Mathematics, Tome 43 (2019) no. 1, p. 139
Voir la notice de l'article provenant de la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts
This paper defines concept of complete hypergraph, enumerates the number of hypergraphs constructed on any nonempty set and determine a lower bound for the number of all complete hypergraphs. We define an equivalence relation on hypergraphs, this relation establishes a connection between hypergraphs and graphs. Moreover, the concept of hypergraph is redefined via the concept of hypergroupoid and a connection between of hypergraphs and hypergroupoids was considered. Finally, we consider a relation between fundamental group and fundamental graph.
Classification :
05C65, 97K30, 20N20 05C65, 97K30, 20N20
Keywords: (Hyper)graph, hypergroupoid, (hyper)group
Keywords: (Hyper)graph, hypergroupoid, (hyper)group
@article{KJM_2019_43_1_a12,
author = {M. Hamidi and A. Boru and and Saied},
title = {Creating and {Computing} {Graphs} from {Hypergraphs}},
journal = {Kragujevac Journal of Mathematics},
pages = {139 },
publisher = {mathdoc},
volume = {43},
number = {1},
year = {2019},
language = {en},
url = {http://geodesic.mathdoc.fr/item/KJM_2019_43_1_a12/}
}
M. Hamidi; A. Boru; and Saied. Creating and Computing Graphs from Hypergraphs. Kragujevac Journal of Mathematics, Tome 43 (2019) no. 1, p. 139 . http://geodesic.mathdoc.fr/item/KJM_2019_43_1_a12/