UPDF AI

Fuzzy Graphs

Huda Mutab Al Mutab

2019 · DOI: 10.24297/jam.v17i0.8443
JOURNAL OF ADVANCES IN MATHEMATICS · 664 Citations

TLDR

The condition under which neighbourly irregular and highly irregular fuzzy graphs are equivalent is provided and the results are compared through various examples.

Abstract

In this paper, neighbourly irregular fuzzy graphs, neighbourly total irregular fuzzy graphs, highly irregular fuzzy graphs and highly total irregular fuzzy graphs are introduced. A necessary and sufficient condition under which neighbourly irregular and highly irregular fuzzy graphs are equivalent is provided. We define d2 degree of a vertex in fuzzy graphs and total d2 -degree of a vertex in fuzzy graphs and (2, k)-regular fuzzy graphs, totally (2, k)- regular fuzzy graphs are introduced. (2, k)- regular fuzzy graphs and totally (2, k)-regular fuzzy graphs are compared through various examples.