Şule Ayar ÖzbalRefet PolatSaadet EskiizmirlilerMehmet KurtKurt, MehmetPolat, RefetOzbal, Sule AyarEskiizmirliler, Saadet2025-10-062024263674672636-74672-s2.0-85208985319https://www.scopus.com/inward/record.uri?eid=2-s2.0-85208985319&partnerID=40&md5=33e119c36d858ff81078781744d7de2bhttps://gcris.yasar.edu.tr/handle/123456789/8160Under 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. © 2024 Elsevier B.V. All rights reserved.Englishinfo:eu-repo/semantics/closedAccessBitonic Algebras, Graphs, Graphs Of Algebras, Upper SetsBitonic AlgebrasGraphsGraphs of AlgebrasUpper SetsArticle