scientific article; zbMATH DE number 227556
\(G=(V,E)\) being a connected simple graph, a hyperoperation ``\(\circ\) is defined on \(V\) by: \[ x\circ y=\begin{cases} x &\text{ if } y=x\\ [x,y] &\text{ if } y\neq x\end{cases} \] for any \(x\), \(y\) in \(V\) (\([x,y]\) is the set of points that belong to some path from \(x\) to \(y\)). Denote by \(H_ G\) the hypergroupoid \((V,\circ)\) obtained in this way. In this paper it is proved that \(H_ G\) is a join space (i.e. a commutative hypergroup in which \(a/b\cap c/d\neq\emptyset\) implies \(a\circ d \cap b\circ c\neq\emptyset\)). Using this construction a denumerable set of finite non isomorphic join spaces is obtained. For other geometrical aspects of join spaces and for more details on the importance of such hypergroups see \textit{W. Prenowitz} and \textit{J. Jantosciak} [Join geometries (1979; Zbl 0421.52001)].
- Join space graphs
- The graph spaces of connectivity maps
- Hypergraphs and hypergroups
- About supergraphs. II
- scientific article; zbMATH DE number 18284 (Why is no real title available?)
- scientific article; zbMATH DE number 885616 (Why is no real title available?)
- scientific article; zbMATH DE number 922359 (Why is no real title available?)
- Color hypergroup and join space obtained by the vertex coloring of a graph
- Hypergraphs and join spaces.
- Chordal graphs and join spaces
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5286943)
