Algorithmic approach to bitonic algebras and their graphs

Abstract

Under the aim of this paper, we establish the terms of graphs related with bitonic-algebras, which is a bitonic-graph where the vertices are the elements of bitonic algebra and where the edges are the companian of two vertices, that is two elements from bitonic algebra. We designate the upper sets of elements in a bitonic algebra and studied properties of these sets. We state algorithms to check whether the given set is a bitonic algebra or a commutative bitonic algebra or not. Additionally, we mention the codes of these algorithms. Moreover, we associate the algorithms of graphs of a bitonic algebra and state properties of these graphs obtained.