Open AccessRegularity of Pythagorean neutrosophic graphs with an illustration in MCDM
Author(s) -
D. Ajay,
P. Chellamani,
Grienggrai Rajchakit,
Nattakan Boonsatit,
Porpattama Hammachukiattikul
Publication year - 2022
Publication title -
aims mathematics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.329
H-Index - 15
ISSN - 2473-6988
DOI - 10.3934/math.2022523
Subject(s) - pythagorean theorem , mathematics , pythagorean triple , enhanced data rates for gsm evolution , set (abstract data type) , indeterminacy (philosophy) , fuzzy logic , discrete mathematics , computer science , artificial intelligence , philosophy , epistemology , geometry , programming language
Pythagorean neutrosophic set is an extension of a neutrosophic set which represents incomplete, uncertain and imprecise details. Pythagorean neutrosophic graphs (PNG) are more flexible than fuzzy, intuitionistic, and neutrosophic models. PNG are similar in structure to fuzzy graphs but the fuzziness is more resilient when compared with other fuzzy models. In this article, regular Pythagorean neutrosophic graphs are studied, where for each element the membership $ (\mathfrak{M}) $, and non-membership $ (\mathfrak{NM}) $ are dependent and indeterminacy $ (\mathfrak{I}) $ is independently assigned. The new ideas of regular, full edge regular, edge regular, and partially edge regular Pythagorean Neutrosophic graphs are introduced and their properties are investigated. A new MCDM method has been introduced using the Pythagorean neutrosophic graphs and an illustrative example is given by applying the proposed MCDM method.