No label defined (Q4513489)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1531075
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 1531075

      Statements

      15 November 2000
      0 references
      connected graphs
      0 references
      hyperoperations
      0 references
      hypergroupoids
      0 references
      hypergroups
      0 references
      directed graphs
      0 references
      0 references
      Let \(G=(V,E)\) be a directed (simple and loopless) and connected graph. Define two hyperoperations on \(V\) as follows: (i) if \(x\) and \(y\) are two distinct vertices of \(G\) then \(x\circ y\) is the set of all vertices on \(x-y\) paths; (ii) \(x\circ x=\{x\}\) for the first hyperoperation and \(x\circ x\) is the set of all vertices on oriented circuits through \(x\). Denote by \(H_1\) and respectively \(H_2\) these two hypergroupoids. Necessary and sufficient conditions for \(H_1\) and \(H_2\) to be hypergroups are given. The results presented in this paper are connected with some others obtained by \textit{J. Nieminen} [J. Geom. 33, No. 1/2, 99-103 (1988; Zbl 0655.05058)] and \textit{P. Corsini} [J. Comb. Inf. Syst. Sci. 16, No. 4, 313-318 (1991; Zbl 0783.20041)].
      0 references

      Identifiers