Left loops, bipartite graphs with parallelism and bipartite involution sets. (Q2581051)

The authors establish a one-to-one correspondence between the class of all semi-regular left loops \((L,+)\) with a suitable class of involution sets \((\nu,J)\) and a suitable class of graphs with parallelism \((\nu,\varepsilon,\parallel)\). This task is solved by means of the concepts of semi-regular bipartite involution set and bipartite graph with parallelism. In this frame the set \(L\) can be identified with a set of involutions acting semi-regularly on \(\nu\) and also with a class of vertices of a bipartite graph with parallelism \((\nu,\varepsilon,\parallel)\). They show that in the set \(\nu\) a new binary operation can be derived from the bipartite involution set \((\nu,J)\).