An alternative construction of graphs by associating with algorithmic approach on MV-algebras

In this paper, we introduce an alternative construction of graphs on MV-algebras. We called them as MV-graphs whose vertices are the elements of MV-algebra and whose edges are the association of two vertices. We also define graphs of equivalence classes by constructing $${\overline{\triangle }}$$ -connection operator and complement annihilator on MV-algebras. We prove some related results based on the algebraic properties of graphs. We handle formation of graph folding on MV-algebras. And, we prove the relation between graphs folding and equivalence classes graph of MV-algebras. Moreover, we associate all of these processes with algorithms to serve related areas that used effectively MV-algebras.