This study introduces and investigates the concept of the (α, β, γ, δ)-level graph for a Turiyam graph, a novel extension of fuzzy and neutrosophic graphs that incorporates a fourth independent membership degree representing the unknown or liberal component. We defined the (α, β, γ, δ)-level graph of a turiyam graph as a crisp graph derived by applying specific threshold values (α, β, γ, δ) to its vertex and edge membership values. In addition, we discuss its application in social networks. This study is supported by illustrative examples.
Fikadu Tesgera Tolasa, V. Repalle, Gamachu Adugna Ganati et al.· Mathematics Open· 0 citations
Level graphs and strong level graphs are introduced as tools to define and compute the chromatic number of BIFGs, demonstrating that the proposed level-graph method yields exact chromatic numbers for classes of BIFGs.
Fikadu Tesgera Tolasa, V. Repalle, G. A. Ganati et al.· F1000Research· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.