Journal of Advances In Mathematics Vol 17 (2019) ISSN: 2347-1921 https://www.cirworld.com/index.

php/jam

DOI: https://doi.org/10.24297/jam.v17i0.8443

Fuzzy Graphs

Huda Mutab Al Mutab

Computer Science Department, College of Science and Human studies in Durma, Shaqra University, Saudi Arabia

e-mail: halmutab@su.edu.sa

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.

Keywords: Fuzzy graph, Irregular fuzzy graph, regular fuzzy graph.

Introduction
In 1975, Rosenfeld considered fuzzy relations on fuzzy sets. He developed the theory of fuzzy graphs. Bang and
Yeh during the same time introduced various connectedness concepts in fuzzy graph. Inexact information is used in
expressing or describing human behaviors and mental process. The information depends upon a person subjectively
and it is difficult to process objectively. Fuzzy information can be analyzed by using a fuzzy graph. Fuzzy graph is an
expression of fuzzy relation and thus the fuzzy graph is frequently expressed in fuzzy matrix. N. R. Santhimaheswari
and C. Sekar in 2016 On strongly edge irregular fuzzy graph. O. T. Manjusha, M. S. Sunitha,in (2016), Connected
domination in fuzzy graphs. K. R. Sandeep Narayan and M. S. Sunitha in 2012, Connectivity in a fuzzy Graph and its
complement. In 1965, Lotfi A. Zadeh introduced the concept of a fuzzy subset of a set as a method for representing
the phenomena of uncertainty in real life situations. Azriel Rosenfeld introduced fuzzy graph in 1975. Alison Northup
introduced semiregular graph also called as (2, k)-regular graph and studied some properties of (2, k)-regular graph.
N. R. Santhi Maheswari and C. Sekar introduced d2 of a vertex in graph and also discussed some properties on d2 of
a vertex in graph and introduced (r, 2, k)-regular graph and also discussed some properties of (r, 2, k)-regular graph.
In this paper, 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.

1 Graph
Definition 1.1 (Crisp graph) A graph G = (V, E) consists of V , a nonempty set of vertices (or nodes) and E, a set
of edges. Each edge has either one or two vertices associated with it, called its endpoints. An edge is said to connect
its endpoints.

ftbpFU3.5674in1.337in0ptExamples of crisp graphs 1Figure(1)

Definition 1.2 The degree of a vertex in an undirected graph is the number of edges incident with it, except that a
loop at a vertex contributes twice to the degree of that vertex. The degree of the vertexv is denoted by deg(v).

232
Journal of Advances In Mathematics Vol 17 (2019) ISSN: 2347-1921 https://www.cirworld.com/index.php/jam

Example 1.1 Figure (2) the degree of the vertex b in the graph H is deg(b) = 6, because b has loop at vertex.

Definition 1.3 The degree dG (v) of a vertex v in G or simply d(v) is the number of edges of G incident with vertex
v.

ftbpFU5.8505in1.8922in0ptThe degree of a vertex in two undirected graphs G and H2Figure(2)

Example 1.2 To find the degrees of the vertices in the graphs G and H displayed in Figure (2).

• In G, deg(a) = 2, deg(b) = deg(c) = deg(f ) = 4, deg(d) = 1, deg(e) = 3,

and deg(g) = 0.
• In H, deg(a) = 4, deg(b) = deg(e) = 6, deg(c) = 1, and deg(d) = 5.

Definition 1.4 A complete graph on n vertices, denoted by Kn , is a simple graph that contains exactly one edge
between each pair of distinct vertices. The graphs Kn , for n = 1, 2, 3, 4, 5, 6, are displayed in Figure (3). A simple
graph for which there is at least one pair of distinct vertex not connected by an edge is called noncomplete.

Example 1.3 Figure (3) examples of Complete Graphs.

ftbpFU5.7735in2.0877in0ptComplete Graphs3Figure(3)

Definition 1.5 Cycles A cycle Cn , n ≥ 3, consists of n vertices v1 , v2 , ..., vn and edges {v1 , v2 },{v1 , v2 }, . . . ,
{vn−1 , vn }, and {vn , v1 }. The cycles C3 , C4 , C5 , and C6 are displayed in Figure (4).

ftbpFU4.7193in1.4105in0ptCycle of crisp graphs4Figure(4)

Definition 1.6 Let n be a nonnegative integer and G an undirected graph. A path of length n from u to v in G is a
sequence of n edges e1 , ..., en of G for which there exists a sequence x0 = u, x1 , ... , xn−1 , xn = v of vertices such that
ei has, for i = 1, ..., n, the endpoints xi−1 and xi . When the graph is simple, we denote this path by its vertex sequence
x0 , x1 , ..., xn (because listing these vertices uniquely determines the path). The path is a circuit if it begins and ends
at the same vertex, that is, if u = v, and has length greater than zero. The path or circuit is said to pass through the
vertices x1 , x2 , ..., xn−1 or traverse the edges e1 , e2 , ..., en . A path or circuit is simple if it does not contain the same
edge more than once.

ftbpFU2.3947in1.5575in0ptPath of graph5Figure(5)

Definition 1.7 An undirected graph is called connected if there is a path between every pair of distinct vertices of the
graph. An undirected graph that is not connected is called disconnected. We say that we disconnect a graph when we
remove vertices or edges, or both, to produce a disconnected subgraph.

Example 1.4 The graph G1 in Figure (6) is connected, because for every pair of distinct vertices there is a path
between them. However, the graph G2 in Figure (6) is not connected. For instance, there is no path in G2 between
vertices a and d.

ftbpFU3.2015in2.1845in0ptConnected graphs and disconnected3.6Figure(3.6)

Definition 1.8 A subgraph of a graph G = (V, E) is a graph H = (W, F ), where W ⊆ V and F ⊆ E. A subgraph H
of G is a proper subgraph of G if H 6= G.

Example 1.5 Figure (7) examples of subgraphs of the original graph.

233
Journal of Advances In Mathematics Vol 17 (2019) ISSN: 2347-1921 https://www.cirworld.com/index.php/jam

ftbpFU3.4108in1.6302in0ptSubgraphs of the original graph3.7Figure(3.7)

Definition 1.9 The degree of an edge (u, v) in the underlying graph is defined as dG (u, v) = dG (u) + dG (v) − 2.

Example 1.6 In figure (6) the degree of edge (a, b) in graph G, dG (a, b) = dG (a) + dG (b) − 2 = 2 + 2 − 2 = 2.

Definition 1.10 A graph G is called regular if every vertex is adjacent only to vertices having the same degree . A
graph G is called irregular, if there is a vertex which is adjacent only to vertices with distinct degrees.

Example 1.7 In figure (6) the graph G1 is irregular graph, because

dG (a) = 2, dG (d) = 3. In figure (7) he original graph is regular fuzzy graph, because every vertex is adjacent only
to vertices having the same degree.

2 Fuzzy graph
Definition 2.1 A Fuzzy graph denoted by G e = (V, E) on the graph G = (V, E) is a pair of functions (σ, µ) where
σ : V −→ [0, 1] is a fuzzy subset of a non empty set V and µ : V × V −→ [0, 1] is a symmetric fuzzy relation on σ such
that for all u and v in V the relation µ(u, v) = µ(uv) ≤ σ(u) ∧ σ(v) is satisfied.

Definition 2.2 A Fuzzy graph G e = (σ, µ) is a pair of functions σ : V −→ [0, 1] where V is the set of vertices and µ
: V × V −→ [0, 1], ∀x, y ∈ V . Fuzzy graph H e induced by hV1 i and V1 ⊆ V if
e = (σ1 , µ1 ) is called a fuzzy subgraph of G
define σ1 on V1 , σ1 : V1 −→ [0, 1], σ1 (x) ≤ σ(x), ∀x ∈ V1 and µ1 on the collection E1 of two element subsets of V1 by
µ1 (x, y) ≤ µ(x, y), ∀x, y ∈ V1 .ftbpFU4.1226in3.0649in0ptRepresentation of fuzzy graph8Figure(8)

Example 2.1 Let E = {x1 , x2 , x3 , x4 , x5 }, then a fuzzy graph could be described as

e i , xj ) = {[(x1 , x2 ) , 0.3] , [(x1 , x3 ) , 0.8] , [(x1 , x1 ) , 0.7] , [(x2 , x1 ) , 0.5]
G(x
, [(x3 , x1 ) 0.2] , [(x3 , x2 ) , 0.6] , [(x4 , x3 ) , 0.8] , [(x1 , x5 ) , 0.9] ,
[(x3 , x5 ) , 0.2] , [(x5 , x2 ) , 0.1]}. Then the fuzzy subgraph H
e of G
e is
e i , xj ) = {[(x1 , x2 ) , 0.1] , [(x1 , x3 ) , 0.4] , [(x1 , x1 ) , 0.3] , [(x3 , x1 ) 0.1] ,
H(x
[(x3 , x2 ) , 0.2] , [(x4 , x3 ) , 0.7] , [(x1 , x5 ) , 0.5] , [(x3 , x5 ) , 0.2] , [(x5 , x2 ) , 0.1]}.

Definition 2.3 Let G e = (σ, µ) be a fuzzy graph on G = (V, E). The degree of a vertex u is d e (u) = P µ(u, v), for
G
P u6=v∈E
(u, v) ∈ E and µ(u, v) = 0, for (u, v) not in E, this is equivalent to dGe (u) = µ(u, v).
(u,v)∈E

Example 2.2 In fuzzy graph G e above in figure (8), d e (a1 ) = 1.0 + 0.5 = 1.5, d e (a2 ) = 1.0, d e (a3 ) = 1.0 + 0.5 = 1.5,
G G G
dGe (b1 ) = 1.0 + 0.5 = 1.5, dGe (b2 ) = 1.0 + 0.5 = 1.5, dGe (b3 ) = 1.0.

Definition 2.4 Let Ge = (σ, µ) be a fuzzy graph on G = (V, E). The total degree of a vertex u is defined as
P
tdGe (u) = µ(u, v) + σ(u) = dGe (u) + σ(u), (u, v) ∈ E.

Example 2.3 Figure (9) Define G e = (σ, µ) by σ(u) = 0.9, σ(v) = 0.8, σ(w) = 0.7, σ(x) = 0.6, and µ(u, v) = 0.2,
µ(u, w) = 0.4, µ(w, x) = 0.4, µ(x, v) = 0.3, then
P P
tdGe (u) = µ(u, v) +σ(u) = dGe (u) + σ(u) = 0.7 + 0.9 = 1.6, tdGe (v) = µ(u, v) +σ(v) = dGe (v) + σ(v) =
u6=v P u6=v P
0.5 + 0.8 = 1.3, tdGe (w) = µ(u, w) +σ(w) = dGe (w) + σ(w) = 0.9 + 0.7 = 1.6, tdGe (x) = µ(u, x) +σ(x) =
w6=u x6=u
dGe (x) + σ(x) = 0.7 + 0.6 = 0.3.

234
Journal of Advances In Mathematics Vol 17 (2019) ISSN: 2347-1921 https://www.cirworld.com/index.php/jam

Definition 2.5 Let G e = (σ, µ) be a fuzzy graph on G = (V, E). Then Ge is said to be a irregular fuzzy graph if there
exists a vertex which is adjacent to a vertices with distinct degrees.

Example 2.4 Define G e = (σ, µ) by σ(u) = 0.4 , σ(v) = 0.6, σ(w) = 0.4, σ(x) = 0.2, σ(y) = 0.5, and µ(u, v) = 0.2,
µ(v, w) = 0.4, µ(w, x) = 0.3, µ(x, y) = 0.2, µ(u, y) = 0.3, ∃u, v ∈ G e such that d e (u) = 0.2 + 0.3 = 0.5 and
G
dGe (v) = 0.2 + 0.4 = 0.6, such that u, v are adjacent vertices but dGe (u) 6= dGe (v).

Definition 2.6 Let G e = (σ, µ) be a fuzzy graph on G = (V, E). Then G e is said to be a totally irregular fuzzy graph if
there exists a vertex which is adjacent to a vertices with distinct total degrees.

ftbpFU2.6878in2.3627in0ptTotally irregular fuzzy graph9Figure(9)

Example 2.5 See Figure (9). Define G

e = (σ, µ) by σ(u) = 0.9, σ(v) = 0.8, σ(w) = 0.7, σ(x) = 0.6, and µ(u, v) = 0.2,
µ(u, w) = 0.4, µ(w, x) = 0.4,
µ(x, v) = 0.3, then
P
tdGe (u) = µ(u, v) +σ(u) = dGe (u) + σ(u) = 0.7 + 0.9 = 1.6,
u6=v
P
tdGe (v) = µ(u, v) +σ(v) = dGe (v) + σ(v) = 0.5 + 0.8 = 1.3,
u6=v
P
tdGe (w) = µ(u, w) +σ(w) = dGe (w) + σ(w) = 0.9 + 0.7 = 1.6,
w6=u
P
tdGe (x) = µ(u, v) +σ(x) = dGe (x) + σ(x) = 0.7 + 0.6 = 1.3.
x6=u

∃u, v ∈ G
e such that td e (u) = 1.6, td e (v) = 1.3, and u, v are adjacent vertices,
G G
tdGe (u) 6= tdGe (v).
G
e is a totally irregular fuzzy graph and an irregular fuzzy graph because,
∃u, v ∈ G
e such that d e (u) = 0.7, d e (v) = 0.5 and u, v are adjacent vertices,
G G
dGe (u) 6= dGe (v).

Definition 2.7 Let G e = (σ, µ) be a fuzzy graph on G = (V, E). Then G

e is said to be a strongly irregular fuzzy graph
if every pair of vertices have distinct degrees.

Example 2.6 Let G e = (σ, µ) be a fuzzy graph on G = (V, E) which is a cycle of length five. From Figure (3.10),
dGe (u) = 0.6, dGe (v) = 0.3, dGe (w) = 0.5, dGe (x) = 0.7, dGe (y) = 0.9. Every pair of vertices have distinct degrees.
Define Ge = (σ, µ) by σ(u) = 0.4, σ(v) = 0.3, σ(w) = 0.5, σ(x) = 0.7, and µ(u, v) = 0.3, µ(v, w) = 0.2,
µ(w, x) = 0.3, µ(x, u) = 0.4. dGe (u) = 0.3 + 0.4 = 0.7, dGe (v) = 0.3 + 0.2 = 0.5, dGe (w) = 0.2 + 0.3 = 0.5,
e has two pair {v, w} , {u, x} vertices having the same degree then G
dGe (x) = 0.3 + 0.4 = 0.7, G e is not strongly irregular
fuzzy graph.

Definition 2.8 Let G e = (σ, µ) be a fuzzy graph on G = (V, E). Then G e is said to be a highly irregular fuzzy graph if
every vertex in G is adjacent to the vertices having distinct degrees.
e

Example 2.7 Define G e = (σ, µ) by σ(u) = 0.4, σ(v) = 0.3, σ(w) = 0.5, σ(x) = 0.7, and µ(u, v) = 0.3, µ(v, w) = 0.2,
µ(w, x) = 0.3, µ(x, u) = 0.4. dGe (u) = 0.3 + 0.4 = 0.7, dGe (v) = 0.3 + 0.2 = 0.5, dGe (w) = 0.2 + 0.3 = 0.5,
dGe (x) = 0.3 + 0.4 = 0.7, every vertex in G
e is adjacent to the vertices having distinct degrees. then G
e is highly irregular
fuzzy graph.

235
Journal of Advances In Mathematics Vol 17 (2019) ISSN: 2347-1921 https://www.cirworld.com/index.php/jam

Definition 2.9 Let G e = (σ, µ) be a fuzzy graph on G = (V, E). Then G e is said to be a neighbourly irregular fuzzy
graph If every two adjacent vertices of a fuzzy graph G have distinct degree.
e

Example 2.8 Define G e = (σ, µ) by σ(u) = 0.8, σ(v) = 0.9, σ(w) = 0.7, σ(x) = 0.6, and µ(u, v) = 0.8, µ(v, w) = 0.4,
µ(w, x) = 0.6, µ(x, u) = 0.6. dGe (u) = 0.8 + 0.6 = 1.4, dGe (v) = 0.4 + 0.8 = 1.2, dGe (w) = 0.4 + 0.6 = 1.0,
dGe (x) = 0.6 + 0.6 = 1.2. We note that every two adjacent vertices of a fuzzy graph G e have distinct degree. Then G e
neighbourly irregular fuzzy graph.

Remark 2.1 A highly irregular fuzzy graph need not be a neighbourly irregular fuzzy graph.

Example 2.9 Define G e = (σ, µ) by σ(u) = 0.7, σ(v) = 0.8, σ(x) = 0.5, σ(y) = 0.9, σ(z) = 0.6, and µ(u, v) = 0.4,
µ(v, x) = 0.4, µ(x, y) = 0.5, µ(u, y) = 0.4, µ(y, z) = 0.6. dGe (u) = 0.4 + 0.4 = 0.8, dGe (v) = 0.4 + 0.4 = 0.8,
dGe (x) = 0.4 + 0.5 = 0.9, dGe (y) = 0.5 + 0.4 + 0.6 = 1.5, dGe (z) = 0.6.

To every vertex v ∈ V , the adjacent vertices have distinct degrees.

Hence Ge is highly irregular. But d e (u) = d e (v) = 0.8.
G G

So G
e is not neighbourly irregular.

Remark 2.2 A neighbourly irregular fuzzy graph need not be a highly irregular fuzzy graph.

Example 2.10 Define G e = (σ, µ) by σ(u) = 0.6, σ(v) = 0.4, σ(w) = 0.5, σ(y) = 0.5, σ(x) = 0.7, and µ(u, v) = 0.6,
µ(v, w) = 0.3, µ(w, y) = 0.2, µ(u, y) = 0.4, µ(w, x) = 0.5, µ(x, y) = 0.3. dGe (u) = 0.6 + 0.4 = 1.0, dGe (v) = 0.6 + 0.3 =
0.9, dGe (w) = 0.3 + 0.2 = 0.5, dGe (y) = 0.2 + 0.4 + 0.3 = 0.9, dGe (x) = 0.5 + 0.3 = 0.8. No two adjacent vertices has the
same degree. So G e is a neighbourly irregular fuzzy graph. But to the vertex u, the adjacent vertices v and y has the
same degree (= 0.9) such that dGe (u) = 1.0, dGe (v) = 0.9, dGe (y) = 0.9. So G e is not highly irregular fuzzy graph.

Definition 2.10 Ge = (σ, µ) be a fuzzy graph. The degree of an edge (u, v) is defined as d e (u, v) = d e (u) + d e (v)
G G G

−2µ(u, v). The minimum degree of an edge is δE (G)
e = ∧ d e (u, v) : (u, v) ∈ E . The maximum degree of an edge is
G

e = ∨ d e (u, v) : (u, v) ∈ E .
∆E (G) G

Example 2.11 In the above example (3.10). Define G

e = (σ, µ) by σ(u) = 0.6,
σ(v) = 0.4, σ(w) = 0.5, σ(y) = 0.5, σ(x) = 0.7,
and µ(u, v) = 0.6, µ(v, w) = 0.3, µ(w, y) = 0.2,
µ(u, y) = 0.4, µ(w, x) = 0.5, µ(x, y) = 0.3.
dGe (u) = 0.6 + 0.4 = 1.0, dGe (v) = 0.6 + 0.3 = 0.9,
dGe (w) = 0.3 + 0.2 = 0.5, dGe (y) = 0.2 + 0.4 + 0.3 = 0.9,
dGe (x) = 0.5 + 0.3 = 0.8. Then
dGe (u, v) = dGe (u) + dGe (v) − 2µ(u, v) = 1.0 + 0.9 − 2(0.6) = 0.7,
dGe (v, w) = dGe (v) + dGe (w) − 2µ(v, w) = 0.9 + 0.5 − 2(0.3) = 0.8,
dGe (w, y) = dGe (w) + dGe (y) − 2µ(w, y) = 0.5 + 0.6 − 2(0.2) = 0.7,
dGe (u, y) = dGe (u) + dGe (y) − 2µ(u, y) = 1.0 + 0.6 − 2(0.4) = 0.8,
dGe (w, x) = dGe (w) + dGe (x) − 2µ(w, y) = 0.5 + 0.8 − 2(0.5) = 0.3,
dGe (x, y) = dGe (x) + dGe (y) − 2µ(x, y) = 0.8 + 0.6 − 2(0.3) = 0.8,

e = ∧ d e (u, v) : (u, v) ∈ E = min {0.7, 0.8, 0.7, 0.8, 0.3, 0.8} = 0.3,
δE (G) G

∆E (G) = ∨ dGe (u, v) : (u, v) ∈ E = max {0.7, 0.8, 0.7, 0.8, 0.3, 0.8} = 0.8.
e

236
Journal of Advances In Mathematics Vol 17 (2019) ISSN: 2347-1921 https://www.cirworld.com/index.php/jam

Definition 2.11 Let G e = (σ, µ) be a fuzzy graph. The total degree of an edge (u, v) is defined as td e (u, v) =
G

dGe (u) + dGe (v) − µ(u, v). The minimum total degree of an edge is δtE (G)
e = ∧ td e (u, v) : (u, v) ∈ E . The maximum
G

total degree of an edge is ∆tE (G)e = ∨ td e (u, v) : (u, v) ∈ E .
G

Example 2.12 Define G e = (σ, µ) by σ(u) = 0.6, σ(v) = 0.4, σ(w) = 0.5, σ(y) = 0.5, σ(x) = 0.7, and µ(u, v) = 0.6,
µ(v, w) = 0.3, µ(w, y) = 0.2, µ(u, y) = 0.4, µ(w, x) = 0.5, µ(x, y) = 0.3.
dGe (u) = 0.6 + 0.4 = 1.0, dGe (v) = 0.6 + 0.3 = 0.9,
dGe (w) = 0.3 + 0.2 = 0.5, dGe (y) = 0.2 + 0.4 + 0.3 = 0.9,
dGe (x) = 0.5 + 0.3 = 0.8. Then
tdGe (u, v) = dGe (u) + dGe (v) − µ(u, v) = 1.0 + 0.9 − 0.6 = 1.3,
tdGe (v, w) = dGe (v) + dGe (w) − µ(v, w) = 0.9 + 0.5 − 0.3 = 1.1,
tdGe (w, y) = dGe (w) + dGe (y) − µ(w, y) = 0.5 + 0.6 − 0.2 = 0.9,
tdGe (u, y) = dGe (u) + dGe (y) − µ(u, y) = 1.0 + 0.6 − 0.4 = 1.2,
tdGe (w, x) = dGe (w) + dGe (x) − µ(w, y) = 0.5 + 0.8 − 0.5 = 0.8,
tdGe (x, y) = dGe (x) + dGe (y) − µ(x, y) = 0.8 + 0.6 − 0.3 = 1.1,

e = ∧ td e (u, v) : (u, v) ∈ E = min {1.3, 1.1, 0.9, 1.2, 0.8, 1.1} = 0.8,
δtE (G) G

∆tE (G)e = ∨ td e (u, v) : (u, v) ∈ E = max {1.3, 1.1, 0.9, 1.2, 0.8, 1.1} = 1.3.
G

3 Connected Fuzzy Graphs

Definition 3.1 (A path of fuzzy graph) In a fuzzy graph G e = (V, σ, µ), a path P of length n is a sequence of distinct
nodes u0 , u1 , ...., un such that µ(ui−1 , ui ) > 0 ; i = 1, 2, ..., n and the degree of membership of a weakest arc is defined
as its strength. If u0 = un and n > 3 then P is called a cycle and P is called a fuzzy cycle, if it contains more than
one weakest arc. The strength of a cycle is the strength of the weakest arc in it. The strength of connectedness between
two nodes x and y is defined as the maximum of the strengths of all paths between x and y and is denoted by
CON NGe (x, y) = max {µ(x, u1 ) ∧ µ(u1 , u2 ) ∧ ..... ∧ µ(un−1 , y) | x, u1 , ..., un−1 , y ∈ V }
, then x, y are connected by path of length n.

Example 3.1 In Figure (9)the fuzzy graph is connected fuzzy graph the path from u to w is (u, v, x, w) of length 3
CON NGe (u, w) = 0.2 > 0.

Definition 3.2 A fuzzy graph G(σ,

e µ) is connected if for every x, y in V ,

µGe (x, y) = CON NGe (x, y) > 0.

Example 3.2 The same in example (4.1) above see figure (9).

Definition 3.3 Let G e = (σ, µ) be a connected fuzzy graph on G = (V, E). Then G is said to be a neighbourly edge
irregular fuzzy graph if every pair of adjacent edges having distinct degrees.

Example 3.3 In the same example (3.8). Define G

e = (σ, µ) by σ(u) = 0.8,

σ(v) = 0.9, σ(w) = 0.7, σ(x) = 0.6, and

237
Journal of Advances In Mathematics Vol 17 (2019) ISSN: 2347-1921 https://www.cirworld.com/index.php/jam

µ(u, v) = 0.8, µ(v, w) = 0.4, µ(w, x) = 0.6, µ(x, u) = 0.6.

Then dGe (u) = 0.8 + 0.6 = 1.4, dGe (v) = 0.8 + 0.4 = 1.2,
dGe (w) = 0.4 + 0.6 = 1.0, dGe (x) = 0.6 + 0.6 = 1.2,
dGe (u, v) = dGe (u) + dGe (v) − 2µ(u, v) = 1.4 + 1.2 − 2(0.8) = 1,
dGe (v, w) = dGe (v) + dGe (w) − 2µ(v, w) = 1.2 + 1.0 − 2(0.4) = 1.4,
dGe (w, x) = dGe (w) + dGe (x) − 2µ(w, x) = 1.0 + 1.2 − 2(0.6) = 1,
dGe (x, u) = dGe (x) + dGe (u) − 2µ(x, u) = 1.2 + 1.4 − 2(0.6) = 1.4 .

Definition 3.4 Let G e = (σ, µ) be a connected fuzzy graph on G = (V, E). Then G e is said to be a neighbourly edge
totally irregular fuzzy graph if every pair of adjacent edges having distinct total degrees.

Example 3.4 Let G e = (σ, µ) be a fuzzy graph on G = (V, E) which is a cycle of length five. From Figure (10),
dGe (u) = 0.6, dGe (v) = 0.3, dGe (w) = 0.5, dGe (x) = 0.7, dGe (y) = 0.9. Total degrees of the edges are calculated as follows:

tdGe (u, v) = dGe (u, v) +µ(u, v) = 0.7 + 0.1 = 0.8,

tdGe (v, w) = dGe (v, w) + µ(v, w) = 0.4 + 0.2 = 0.6,
tdGe (w, x) = dGe (w, x) +µ(w, x) = 0.6 + 0.3 = 0.9,
tdGe (x, y) = dGe (x, y) + µ(x, y) = 0.8 + 0.4 = 1.2,
tdGe (y, u) = dGe (y, u) +µ(y, u) = 0.5 + 0.5 = 1.
We note that every pair of adjacent edges having distinct total degrees. Then G
e is neighbourly edge totally irregular
fuzzy graph.

e = (σ, µ) is said to be complete if µ(u, v) = σ(u)∧σ(v), for all u, v ∈ V and is denoted

Definition 3.5 A fuzzy graph G
by Kσ .

Example 3.5 Let G

e be fuzzy graph Define G
e = (σ, µ) by σ(u) = 0.8,

σ(v) = 0.9, σ(w) = 0.7, σ(x) = 0.6, and

µ(u, v) = 0.8, µ(v, w) = 0.7, µ(w, x) = 0.6, µ(x, v) = 0.6.
Then G
e = (σ, µ) is complete fuzzy graph.
Because µ(u, v) = σ(u) ∧ σ(v), for all u, v ∈ V .
P
Definition 3.6 The order p and size q of a fuzzy graph G = (σ, µ) are defined to be p = σ(x), and q =
P x∈V
µ(x, y).
(x,y)∈V ×V

Example 3.6 Define G e = (σ, µ) by σ(u) = 0.8 , σ(v) = 0.9, σ(w) = 0.7, σ(x) = 0.6, and µ(u, v) = 0.8, µ(v, w) = 0.4,
µ(w, x) = 0.6, the order of G:
e

X
p= σ(x) = σ(u) + σ(v) + σ(w) + σ(x) = 0.8 + 0.9 + 0.7 + 0.6 = 2.5.
x∈V

The size of G:
e
X
q= µ(x, y) = µ(u, v) + µ(v, w) + µ(w, x) = 0.8 + 0.4 + 0.6 + 0.6 = 2.4.
(x,y)∈V ×V

238
Journal of Advances In Mathematics Vol 17 (2019) ISSN: 2347-1921 https://www.cirworld.com/index.php/jam

e = (σ, µ) be a fuzzy graph and S ⊆ V . Then the scalar cardinality of S is defined to be P σ(v)
Definition 3.7 Let G
v∈S
and it is denoted by |S|. Let p denotes the scalar cardinality of V , also called the order of G.
e

Example 3.7 Let G

e be fuzzy graph Define G
e = (σ, µ) by σ(u) = 0.8 , σ(v) = 0.9, σ(w) = 0.7, σ(x) = 0.6, and

µ(u, v) = 0.8, µ(v, w) = 0.7, µ(w, x) = 0.6 , µ(x, v) = 0.6. Let S = {u, v, x} ⊆ V , then the scalar cardinality of S is
P
|S| = σ(v) = 0.8 + 0.9 + 0.6 = 2.3.
v∈S

Notation 1 A node u is said to be isolated if µ(u, v) = 0 for all v 6= u.

Definition 3.8 Let G e = (σ, µ) be a connected fuzzy graph on G = (V, E). Then G e is said to be a strongly edge
irregular fuzzy graph if every pair of edges having distinct degrees (or) no two edges have same degree.

Example 3.8 Let G e = (σ, µ) be a fuzzy graph on G = (V, E) which is a cycle of length five. From Figure (10),
dGe (u) = 0.6, dGe (v) = 0.3, dGe (w) = 0.5, dGe (x) = 0.7, dGe (y) = 0.9.

Degrees of the edges are calculated as follows:

dGe (u, v) = dGe (u) + dGe (v) − 2µ(u, v) = 0.6 + 0.3 − 2(0.1) = 0.7,

dGe (v, w) = dGe (v) + dGe (w) − 2µ(v, w) = 0.3 + 0.5 − 2(0.2) = 0.4,

dGe (w, x) = dGe (w) + dGe (x) − 2µ(w, x) = 0.5 + 0.7 − 2(0.3) = 0.6,

dGe (x, y) = dGe (x) + dGe (y) − 2µ(x, y) = 0.7 + 0.9 − 2(0.4) = 0.8,

dGe (y, u) = dGe (y) + dGe (u) − 2µ(y, u) = 0.9 + 0.6 − 2(0.5) = 0.5.

Definition 3.9 Let G = (σ, µ) be a connected fuzzy graph on G = (V, E). Then G e is said to be a strongly edge totally
irregular fuzzy graph if every pair of edges having distinct total degrees (or) no two edges have same total degree.

ftbpFU3.8078in2.6775in0ptStrongly edge irregular fuzzy graph10qFigure(10q)

We noted that every pair of edges having distinct degrees. Hence G
e is strongly
edge irregular fuzzy graph.

Example 3.9 Let G e = (σ, µ) be a fuzzy graph on G = (V, E) which is a cycle of length five. From Figure (10),
dGe (u) = 0.6, dGe (v) = 0.3, dGe (w) = 0.5, dGe (x) = 0.7, dGe (y) = 0.9. Total degrees of the edges are calculated as follows:

tdGe (u, v) = dGe (u, v) +µ(u, v) = 0.7 + 0.1 = 0.8,

tdGe (v, w) = dGe (v, w) + µ(v, w) = 0.4 + 0.2 = 0.6,
tdGe (w, x) = dGe (w, x) +µ(w, x) = 0.6 + 0.3 = 0.9,
tdGe (x, y) = dGe (x, y) + µ(x, y) = 0.8 + 0.4 = 1.2,
tdGe (y, u) = dGe (y, u) +µ(y, u) = 0.5 + 0.5 = 1.
It is noted that every pair of edges in G
e having distinct total degrees. So, G
e is strongly edge totally irregular fuzzy
graph. Hence G e is both strongly edge irregular fuzzy graph and strongly edge totally irregular fuzzy graph.

239
Journal of Advances In Mathematics Vol 17 (2019) ISSN: 2347-1921 https://www.cirworld.com/index.php/jam

Remark 3.1 Graph in Figure (10) is both strongly edge irregular fuzzy graph and strongly edge totally irregular fuzzy
graph.ftbpFU2.898in2.1326in0ptStrongly edge but not strongly edge totally11Figure(11)

Example 3.10 Strongly edge irregular fuzzy graphs need not be strongly edge totally irregular fuzzy graphs.
From Figure (11), dGe (u) = 0.5, dGe (v) = 0.7,
dGe (w) = 0.6. Also, dGe (u, v) = 0.6, dGe (v, w) = 0.5,
dGe (w, u) = 0.7, tdGe (u, v) = 0.9, tdGe (v, w) = 0.9, tdGe (w, u) = 0.9.

We noted that G e is strongly edge irregular fuzzy graph, since every pair of edges having distinct degrees. Also, G
e
is not strongly edge totally irregular fuzzy graph, since all the edges having same total degree. Hence strongly edge
irregular fuzzy graph need not be strongly edge totally irregular fuzzy graph.
ftbpFU4.0707in2.0384in0ptStrongly edge totally need not be strongly edge 12Figure(12)

Example 3.11 Strongly edge totally irregular fuzzy graph need not be strongly edge irregular fuzzy graph. Consider
G = (V, E) where V = {u; v; w; x} and E = {(u, v), (v, w), (w, x), (x, u)}. And G e = (σ, µ), be fuzzy graph From Figure
(12) dGe (u) = 1.1, dGe (v) = 0.8, dGe (w) = 1.2, dGe (x) = 1.5. dGe (u, v) = 1.3, dGe (v, w) = 1, dGe (w, x) = 1.3, dGe (x, u) = 1.
It is noted that dGe (u, v) = dGe (w, x) = 1.3. Hence G e is not strongly edge irregular fuzzy graph. Also, td e (u, v) = 1.6,
G
tdGe (v, w) = 1.5, tdGe (w, x) = 2, tdGe (u, v) = 1.8. It is observed that tdGe (u, v) 6= tdGe (v, w) 6= tdGe (w, x) 6= tdGe (x, u). So,
Ge is strongly edge totally irregular fuzzy graph. Hence strongly edge totally irregular fuzzy graph need not be strongly
edge irregular fuzzy graph.

Theorem 3.1 Let G e = (σ, µ) be a connected fuzzy graph on G = (V, E) and is constant function. If G
e is strongly
edge irregular fuzzy graph, then G is strongly edge totally irregular fuzzy graph.
e

Assume that is a constant function, let µ(u, v) = c for all (u, v) ∈ E,

where c is constant. Let (u, v) and (x, y) be any pair of edges in E.
Suppose that G
e is strongly edge irregular fuzzy graph.
Then dGe (u, v) 6= dGe (x, y), where
(u, v) and (x, y) are any pair of edges in E .
=⇒ dGe (u, v) 6= dGe (x, y) =⇒ dGe (u, v) + c 6= dGe (x, y) + c
=⇒ dGe (u, v) + µ(u, v) 6= dGe (x, y) + µ(x, y)
=⇒ tdGe (u, v) 6= tdGe (x, y),
where (u, v) and (x, y) are any pair of edges in E.
Hence G is strongly edge total irregular fuzzy graph.

Theorem 3.2 Let G e = (σ, µ) be a connected fuzzy graph on G = (V, E) and µ is constant function. If G
e is strongly
edge totally irregular fuzzy graph, then G is strongly edge irregular fuzzy graph.
e

Assume that µ is a constant function, let µ(u, v) = c for all (u, v) ∈ E,

where c is constant. Let (u, v) and (x, y) be any pair of edges in E.
Suppose that G
e is strongly edge totally irregular fuzzy graph.
Then tdGe (u, v) 6= tdGe (x, y),
where (u, v) and (x, y) are any pair of edges in E.
=⇒ tdGe (u, v) 6= tdGe (x, y)

240
Journal of Advances In Mathematics Vol 17 (2019) ISSN: 2347-1921 https://www.cirworld.com/index.php/jam

=⇒ dGe (u, v) + µ(u, v) 6= dGe (x, y) + µ(x, y)

=⇒ dGe (u, v) +c 6= dGe (x, y) + c
=⇒ dGe (u, v) 6= dGe (x, y).
Where (u, v) and (x, y) are any pair of edges in E.
Hence G
e is strongly edge irregular fuzzy graph.

Remark 3.2 Let G e = (σ, µ) be a connected fuzzy graph on G = (V, E). If G

e is both strongly edge irregular fuzzy graph
and strongly edge totally irregular fuzzy graph. Then need not be a constant function.

ftbpFU3.8078in2.6775in0ptµ is not constant function13Figure(13)

Example 3.12 Let G

e = (σ, µ) be a fuzzy graph on G = (V, E) which is a cycle of length five. From Figure (13),

dGe (u) = 0.6, dGe (v) = 0.3, dGe (w) = 0.5, dGe (x) = 0.7, dGe (y) = 0.9. Also, dGe (u, v) = 0.7, dGe (v, w) = 0.4, dGe (w, x)
= 0.6, dGe (x, y) = 0.8, dGe (y, u) = 0.5. It is noted that every pair of edges in G e having distinct degrees. Hence
G is strongly edge irregular fuzzy graph. Also, tdGe (u, v) = 0.8, tdGe (v, w) = 0.6, tdGe (w, x) = 0.9, tdGe (x, y) = 1.2,
e
tdGe (y, u) = 1. Note that every pair of edges in G e having distinct total degrees. Hence G e is both strongly edge irregular
fuzzy graph and strongly edge totally irregular fuzzy graph. But µ is not constant function.

Theorem 3.3 Let G e = (σ, µ) be a fuzzy graph on G = (V, E). If G

e is strongly edge irregular fuzzy graph, then G
e is
neighbourly edge irregular fuzzy graph.

Let Ge = (σ, µ) be a fuzzy graph on G = (V, E). Let us assume that G e is strongly edge irregular fuzzy graph
then every pair of edges in G
e have distinct degrees so every pair of adjacent edges have distinct degrees. Hence Ge is
neighbourly edge irregular fuzzy graph.

Theorem 3.4 Let G e = (σ, µ) be a fuzzy graph on G = (V, E). If G

e is strongly edge totally irregular fuzzy graph, then
G
e is neighbourly edge totally irregular fuzzy graph.

Let G
e = (σ, µ) be a fuzzy graph on G = (V, E). Let us assume that G e is strongly edge totally irregular fuzzy graph
then every pair of edges in G
e have distinct total degrees so every pair of adjacent edges have distinct total degrees.
Hence Ge is neighbourly edge total irregular fuzzy graph.

Remark 3.3 Converse of the above two Theorems need not be true.

ftbpFU5.8297in0.9279in0ptCounter example14Figure(14)

Example 3.13 Consider G

e = (σ, µ) be a fuzzy graph such that G = (V, E) is a path on four vertices. From Figure
(14),

dGe (u) = 0.6, dGe (v) = 1.2, dGe (w) = 1.2, dGe (x) = 0.6, dGe (u, v) = 0.6, dGe (v, w) = 1.2, dGe (w, x) = 0.6. Here,
dGe (u, v) 6= dGe (v, w) and dGe (v, w) 6= dGe (w, x). Hence Ge is neighbourly edge irregular fuzzy graph. But Ge is not strongly
edge irregular fuzzy graph, since dGe (u, v) = dGe (w, x) = 0.6. Also, tdGe (u, v) = 1.2, tdGe (v, w) = 1.8, tdGe (w, x) = 1.2.
Note that tdGe (u, v) 6= tdGe (v, w) and tdGe (v, w) 6= tdGe (w, x). Hence Ge is neighbourly edge totally irregular fuzzy graph.
But G is not strongly edge totally irregular fuzzy graph, since tdGe (u, v) = tdGe (w, x) = 1.2.
e

Theorem 3.5 Let G e = (σ, µ) be a fuzzy graph on G = (V, E), a star K1,n . If the membership values of no two edges
are the same, then G is strongly edge irregular fuzzy graph and G
e e is totally edge regular fuzzy graph.

241
Journal of Advances In Mathematics Vol 17 (2019) ISSN: 2347-1921 https://www.cirworld.com/index.php/jam

Let v1 , v2 , v3 , ...., vn be the vertices adjacent to the vertex x.

Let e1 , e2 , e3 , ......, en be the edges of a star G
e in that order having
membership values c1 , c2 , c3 , ......, cn such that c1 6= c2 6= c3 , ......, 6= cn . Then
dGe (ei ) = dGe (x) + dGe (vi ) − 2ci = (c1 + c2 + c3 + ...... + cn ) +ci − 2ci , (1 ≤ i ≤ n).
dGe (ei ) = (c1 + c2 + c3 + ...... + cn ) − ci , (1 ≤ i ≤ n).
All edges ei , (1 ≤ i ≤ n) having distinct degrees.
Hence G
e is strongly edge irregular fuzzy graph.
Also, tdGe (ei ) = dGe (x) + dGe (vi ) − ci
= (c1 + c2 + c3 + ...... + cn ) + ci − ci , 1 ≤ i ≤ n, and
tdGe (ei ) = (c1 + c2 + c3 + ...... + cn ), 1 ≤ i ≤ n.
All edges ei , 1 ≤ i ≤ n, having same total degree.
Hence Ge is totally edge regular fuzzy graph.

Remark 3.4 A complete fuzzy graph need not be neighbourly irregular.

Example 3.14 Define G

e = (σ, µ) by σ(u) = 0.5, σ(v) = 0.4, σ(x) = 0.7,
σ(w) = 0.5 and µ(u, v) = 0.4, µ(v, x) = 0.4, µ(x, w) = 0.5,
µ(w, u) = 0.5, µ(u, x) = 0.5, µ(v, w) = 0.4,
dGe (u) = 0.5 + 0.4 + 0.5 + 0.5 = 1.9, dGe (v) = 0.4 + 0.4 + 0.4 + 0.4 = 1.6, dGe (x) = 0.7 + 0.4 + 0.5 + 0.5 = 2.1,
dGe (w) = 0.5 + 0.4 + 0.5 + 0.5 = 1.9.
G
e is a complete fuzzy graph but not neighbourly irregular.

4 Regular Fuzzy Graphs

Definition 4.1 Let Ge = (σ, µ) be a fuzzy graph on G = (V, E). If d e (v) = k for all v ∈ V , i.e. if each vertex has the
G
same degree k, then G
e is said to be a regular fuzzy graph of degree k or a k-regular fuzzy graph.

Example 4.1 Let G = (V, E) where V = {u, v, w, x} and E = {(u, v), (v, w), (w, x), (x, u)}, In Figure (14), dGe (u) =
0.5, dGe (v) = 0.5, dGe (w) = 0.5, dGe (x) = 0.5. Each vertex has the same degree 0.5. Hence G
e is a regular fuzzy graphs
of degree 0.5.

ftbpFU3.4523in1.6924in0ptA regular fuzzy graph of degree 0.515Figure(15)

P
Definition 4.2 The total degree of a vertex u is defined as tdGe (u) = µ(uv) + σ(u) = dGe (u) + σ(u), (u, v) ∈ E. If
each vertex of G has the same total degree k, then G is said to be the totally regular fuzzy graph of total degree k, or
e e
a k-totally regular fuzzy graph.

ftbpFU2.8236in1.8083in0ptRegular fuzzy graph and totally regular fuzzy graph.16Figure(16)

Example 4.2 Let G

e = (σ, µ) be a fuzzy graph on G = (V, E), an even cycle of length six. It is noted that in Figure

(16), dGe (u) = 0.6, dGe (v) = 0.6, dGe (w) = 0.6, dGe (x) = 0.6, dGe (y) = 0.6, dGe (z) = 0.6 ⇒ G e is a (0.6)-regular fuzzy
graph. Also, note that tdGe (u) = 1.0, tdGe (v) = 1.0, tdGe (w) = 1.0, tdGe (x) = 1.0, tdGe (y) = 1.0, tdGe (x) = 1.0.

242
Journal of Advances In Mathematics Vol 17 (2019) ISSN: 2347-1921 https://www.cirworld.com/index.php/jam

4.1 dm -degree of a vertex in Fuzzy Graps

Definition 4.3 Let G

e = (σ, µ) be a fuzzy graph. The dm -degree of a vertex u in

e is dm (u) = P µm (u, v),where

G
µm (u, v) = sup{µ(u, , u1 ) ∧ µ(u1 , u2 ) ∧ ..., µ(um−1 , v) : (u, u1 , u2 , ..., um−1 , v ) is
the shortest path connecting u and v of length m}.
Also, µ(u, v) = 0, for (u, v) not in E.
The minimum dm -degree of G e = ∧{dm (v) : v ∈ V }.
e is δm (G)

The maximum dm -degree of G e = ∨{dm (v) : v ∈ V }.

e is ∆m (G)

Definition 4.4 Let G

e = (σ, µ) be a fuzzy graph.

e is d2 (u) = P µ2 (u, v), where

The d2 -degree of a vertex u in G
µ2 (u, v) = sup{µ(u, u1 ) ∧ µ(u1 , v) : (u, u1 , v) is the shortest path
connecting u and v of length 2}. Also, µ(u, v) = 0, for (u, v) not in E.
e is δ2 (G) = ∧{d2 (v) : v ∈ V }.
The minimum d2 -degree of G
The maximum d2 -degree of G e = ∨{d2 (v) : v ∈ V }.
e is ∆2 (G)

Example 4.3 Consider G = (V, E) where V = {u, v, w, x, y} and

E = {(u, v), (v, w), (w, x), (x, y), (y, u)}. Define G
e = (σ, µ)
by σ(u) = 0.2, σ(v) = 0.6, σ(w) = 0.5, σ(x) = 0.4, σ(y) = 0.3
and µ(u, v) = 0.1, µ(v, w) = 0.3, µ(w, x) = 0.3, µ(x, y) = 0.2, µ(y, u) = 0.2.ftbpFU3.4523in2.4993in0ptMinimum
d2 -degree of G
e and maximum17Figure(17)
In Figure (17), d2 (u) = {0.1 ∧ 0.3} + {0.2 ∧ 0.2} = 0.1 + 0.2 = 0.3.
d2 (v) = {0.1 ∧ 0.2} + {0.3 ∧ 0.3} = 0.1 + 0.3 = 0.4.
d2 (w) = {0.3 ∧ 0.2} + {0.3 ∧ 0.1} = 0.2 + 0.1 = 0.3.
d2 (x) = {0.2 ∧ 0.2} + {0.3 ∧ 0.3} = 0.2 + 0.3 = 0.5.
d2 (y) = {0.1 ∧ 0.2} + {0.2 ∧ 0.3} = 0.1 + 0.2 = 0.3.
The minimum d2 -degree of G
e is
δ2 (G) = ∧{d2 (v) : v ∈ V } = min {0.3, 0.4, 0.3, 0.5, 0.3}
The maximum d2 -degree of G e is
e = ∨{d2 (v) : v ∈ V } = max {0.3, 0.4, 0.3, 0.5, 0.3}
∆2 (G)

Definition 4.5 Let G e = (σ, µ) be a fuzzy graph on G = (V, E). If dm (v) = k for all v ∈ V , then G
e is said to be
(m, k)-regular fuzzy graph.

Definition 4.6 Let G

e = (σ, µ) be a fuzzy graph on G = (V, E). If d2 (v) = k for

all v ∈ V , then G is said to be (2, k)-regular fuzzy graph.

Example 4.4 Consider G = (V, E) where V = {u, v, w, x, y} and E = {(u, v), (v, w), (w, x)}.

243
Journal of Advances In Mathematics Vol 17 (2019) ISSN: 2347-1921 https://www.cirworld.com/index.php/jam

Define G
e = (σ, µ) by σ(u) = 0.2, σ(v) = 0.3, σ(w) = 0.4, σ(x) = 0.5, and
µ(u, v) = 0.2, µ(v, w) = 0.2, µ(w, x) = 0.2.
In Figure (18), d2 (u) = 0.2, d2 (v) = 0.2, d2 (w) = 0.2, d2 (x) = 0.2.
This graph is (2, 0.2)- regular fuzzy graph.
ftbpFU2.1638in1.913in0pt(2, 0.2)- regular fuzzy graph18Figure(18)

4.2 Total dm -degree of a vertex in Fuzzy Graph

Definition e = (σ, µ) be a fuzzy graph on G = (V, E). The total dm -degree of a vertex u ∈ V is defined as
P4.7
m
Let G
tdm (u) = µ (u, v) + σ(u) = dm (u) + σ(u).

The minimum tdm -degree of G e = ∧{tdm (v) : v ∈ V }.

e istδm (G)

The maximum tdm -degree of G e = ∨{tdm (v) : v ∈ V }.

e is t∆m (G)
Now, total d2 -degree of a vertex in fuzzy graph is defined.

Definition 4.8 Let G

e = (σ, µ) be a fuzzy graph on G = (V, E).

The total d2 -degree of a vertex u ∈ V is defined as

td2 (u) = µ2 (u, v) + σ(u) = d2 (u) + σ(u).
P

e is tδ2 (G) = ∧{td2 (v) : v ∈ V }.

The minimum td2 -degree of G
e is t∆2 (G) = ∨{td2 (v) : v ∈ V }.
The maximum td2 -degree of G

Example 4.5 Consider G = (V, E) where V = {u, v, w, x}

and E = {(u, v), (v, w), (w, x), (x, u)}. Define G
e = (σ, µ)
by σ(u) = 0.2, σ(v) = 0.3, σ(w) = 0.4, σ(x) = 0.5.
and µ(u, v) = 0.1, µ(v, w) = 0.3, µ(w, x) = 0.4, µ(x, u) = 0.2.
In Figure (3.18), d2 (u) = Sup{0.1 ∧ 0.3, 0.2 ∧ .4} = Sup{0.1, 0.2} = 0.2,
d2 (v) = Sup{0.1 ∧ 0.2, 0.3 ∧ 0.4} = Sup{0.1, 0.3} = 0.3,
d2 (w) = Sup{0.4 ∧ 0.2, 0.3 ∧ 0.1} = Sup{0.2, 0.1} = 0.2,
d2 (x) = Sup{0.2 ∧ 0.1, 0.4 ∧ 0.3} = Sup{0.1, 0.3} = 0.3.
td2 (u) = 0.2 + 0.2 = 0.4, td2 (v) = 0.3 + 0.3 = 0.6,
td2 (w) = 0.2 + 0.4 = 0.6, td2 (x) = 0.3 + 0.5 = 0.8.

Definition 4.9 (Totally (m, k)-Regular Fuzzy Graph ) If each vertex of G

e has the same total dm - degree k, then G
e is
said to be totally (m, k)-regular fuzzy graph.

Definition 4.10 If each vertex of G

e has the same total d2 - degree k, then G
e is
said to be totally (2, k)-regular fuzzy graph.ftbpFU3.4731in2.5201in0ptA totally (2, k)-regular fuzzy graph need not
be a (2, k)-regular fuzzy graph19Figure(19)

Example 4.6 1- A totally (2, k)-regular fuzzy graph need not be a (2, k)-regular fuzzy graph. Consider G = (V, E)
where V = {u, v, w, x, y} and E = {(u, v), (v, w), (w, x), (x, y), (y, u)}.

244
Journal of Advances In Mathematics Vol 17 (2019) ISSN: 2347-1921 https://www.cirworld.com/index.php/jam

Note that in Figure (19),

d2 (u) = 0.6, d2 (v) = 0.4, d2 (w) = 0.5, d2 (x) = 0.6, d2 (y) = 0.5 and
td2 (u) = 1, td2 (v) = 1, td2 (w) = 1, td2 (x) = 1, td2 (y) = 1.
Each vertex has same total d2 -degree 1.
Hence G
e is totally (2, 1)-regular fuzzy graph.

But G
e is not (2, k)-regular fuzzy graph.
2- A (2, k)-regular fuzzy graph need not be a totally (2, k)-regular fuzzy graph.
Consider G = (V, E) where V = {u, v, w, x} and E = {(u, v), (v, w), (w, x), (x, u)}.
In Figure (20), d2 (u) = 0.2, d2 (v) = 0.2, d2 (w) = 0.2, d2 (x) = 0.2
and td2 (u) = 0.5, td2 (v) = 0.9, td2 (w) = 0.7, td2 (x) = 0.6.
Each vertex has the same d2 -degree (0.2).
So, G
e is (2, 0.2)-regular fuzzy graph.

But G
e is not a totally (2, k)-regular fuzzy graph.
ftbpFU3.5993in1.5463in0ptA (2, k)-regular fuzzy graph need not be a totally (2, k)-regular fuzzy graph20Figure(20)
3- A (2, k)-regular fuzzy graph which is totally (2, k)-regular fuzzy graph.
Consider G = (V, E) where V = {u, v, w, x, y, z} and
E = {(u, v), (v, w), (w, x), (x, y), (y, z), (z, u)}.
In figure (21), d2 (u) = 0.6, d2 (v) = 0.6, d2 (w) = 0.6, d2 (x) = 0.6,
d2 (y) = 0.6, d2 (z) = 0.6 and td2 (u) = 1, td2 (v) = 1, td2 (w) = 1,
td2 (x) = 1, td2 (y) = 1, td2 (z) = 1.
Each vertex has the same d2 -degree (0.6).
So, G
e is a (2, 0.6)-regular fuzzy graph.
Each vertex has the same total d2 -degree 1.
Hence G
e is a totally (2, 1)-regular fuzzy graph.
ftbpFU3.1808in1.9233in0ptA (2, k)-regular fuzzy graph which is totally (2, k)-regular fuzzy graph21Figure(21)

Theorem 4.1 Let G = (σ, µ) be fuzzy graph on G = (V, E). Then σ is constant function iff the following conditions
are equivalent.
(i) G
e is (2, k)- regular fuzzy graph.

(ii) G
e is totally (2, k)- regular fuzzy graph.

Suppose that σ is a constant function. Let σ(u) = c, constant for all

u∈V.
e is (2, k)-regular fuzzy graph . Then d2 (u) = k, for all u ∈ V
Assume that G
So td2 (u) = d2 (u) + σ(u), for all u ∈ V ⇒ td2 (u) = k + c, for all u ∈ V .
e is totally (2, k + c) -regular fuzzy graph. Thus (1) ⇒ (2) is proved.
Hence G
Now suppose G
e is totally (2, k)- regular fuzzy graph
⇒ td2 (u) = k , for all u ∈ V .
⇒ d2 (u) + σ(u) = k, for all u ∈ V .
⇒ d2 (u) + c = k, for all u ∈ V .

245
Journal of Advances In Mathematics Vol 17 (2019) ISSN: 2347-1921 https://www.cirworld.com/index.php/jam

⇒ d2 (u) = k − c for all u ∈ V .

e is (2, k − c) - regular fuzzy graph.
Hence G
Hence (i)&(ii) are equivalent.
Conversely assume that (i) and (ii) are equivalent.
Suppose σ is not a constant function. Then σ(u) 6= σ(w) ,
for at least one pair u, w ∈ V .
Let Ge be a (2, k)-regular fuzzy graph. Then d2 (u) = d2 (w) = k. So
td2 (u) = d2 (u) + σ(u) = k + σ(u) and td2 (w) = d2 (w) + σ(w) = k + σ(w).
Since σ(u) 6= σ(w) ⇒ k + σ(u) 6= k + σ(w) ⇒ td2 (u) 6= td2 (w).
So G
e is not totally (2, k) - regular fuzzy graph which is a contradiction to
our assumption.
Let G
e be a totally (2, k)-regular fuzzy graph. Then td2 (u) = td2 (w)
⇒ d2 (u) + σ(u) = d2 (w) + σ(w)
⇒ d2 (u) − d2 (w) = σ(w) − σ(u) 6= 0
⇒ d2 (u) 6= d2 (w). So G
e is not (2, k) - regular fuzzy graph which is a contradiction to our assumption. Hence σ is
a constant function.

References
[1] A. Rosenfeld. : Fuzzy graphs, In: L. A. Zadeh, K. S. Fu, M. Shimura, EDs. .:Fuzzy Sets and Their Applications,
Academic press (1975), pp. 77-95.
[2] A. Nagoor Gani and K. Radha .:The degree of a vertex in some fuzzy graphs ,International Journal of algorithms,
computing and Mathematics, 2(3), (2009), pp. 107-116.
[3] A. Nagoor Gani and K. Radha. .: On Regular Fuzzy graphs, Journal of Physical Science, (12), (2008), pp. 33-40.
[4] A. Nagoor Gani and M. Basheer Ahmed. .: Order and Size in fuzzy graph, Bulletin of pure and applied Sciences,
22E(1), (2003), pp. 145-148.

[5] A. Nagoor Gani and S. R. Latha. .: On irregular fuzzy graphs, Appl. Math. Sci.6 (2012), pp. 33-44.
[6] H. J. Zimmermann. : Fuzzy set Theory And its Applications, Second edition. Kluwer Academic Puplishers,
Bosten, Dordrecht, London, (1990).
[7] J. N. Mordeson and P. S. Nair. .: Fuzzy graphs and Fuzzy hypergraphs, Physica verlag, (2000).

[8] K. H. Rosen .: Discrete Mathematic and Its Applications, Seventh Edition, McGraw Hill companies, America
,New York , (2012).
[9] K. Radha and N. Kumaravel. .: Some Properties of edge regular fuzzy graphs, Jamal Acad. Res. J. (2014), pp.
121-127.

[10] K. R. Bhutani, and A. Rosenfeld. .: Fuzzy end nodes in fuzzy graphs, Information Sciences, (2003), pp. 319-322.
[11] K. R. Sandeep Narayan and M. S. Sunitha .: Connectivity in a Fuzzy Graph and its Complement, Gen. Math.
Notes, 9(1), (2012), pp. 38-43.
[12] M. Hussain. .: Fuzzy Relations. Belking Institute of Technology School of Engineering Department of Mathematics
and Science, (2010).

246
Journal of Advances In Mathematics Vol 17 (2019) ISSN: 2347-1921 https://www.cirworld.com/index.php/jam

[13] N. R. Santhi Maheswari and C. Sekar. .: On (2, k )-regular fuzzy graphs, G.Venkataswamy Naidu College,
Kovilpatti- 628502, India, (2010).
[14] N. R. Santhi Maheswair and C. Sekar. .: On neighbourly edge irregular fuzzy graphs, International Journal of
Mathematical Archive 6 (10) (2015), pp. 224-231.
[15] N. R. Santhi Maheswari and C. Sekar .: On strongly edge irregular fuzzy graphs. Kragu Jevac Journal of Math-
ematics, Volume 40(1), (2016), pp. 125-135.

[16] O. T. Manjusha, M. S. Sunitha .: Connected domination in fuzzy graphs using strong arcs, Annals of Fuzzy
mathematics and Informatics, volume x, (2015), pp. 1-xx.
[17] P. Bhattachara. .: Some Remarks on Fuzzy Graphs, Pattern Reconition Lett.6 (1987), pp. 297-302.

[18] S. N. Sivanandam, S. Sumathi and S. N. Deepa. .: Introduction to Fuzzy Logic using MATLAB. Springer-verlag
Berlin Heidelberg, (2007).
[19] S. P. Nandhini and E. Nandhini. .: Strongly irregular fuzzy geaphs, International Journal of Algorithms, Com-
puting and Mathematics 2 (3) (2009), pp. 107-116.

247