# On *m*-polar fuzzy graph structures

- Muhammad Akram
^{1}, - Rabia Akmal
^{1}and - Noura Alshehri
^{2}Email author

**Received: **8 June 2016

**Accepted: **12 August 2016

**Published: **30 August 2016

## Abstract

Sometimes information in a network model is based on multi-agent, multi-attribute, multi-object, multi-polar information or uncertainty rather than a single bit. An *m*-polar fuzzy model is useful for such network models which gives more and more precision, flexibility, and comparability to the system as compared to the classical, fuzzy and bipolar fuzzy models. In this research article, we introduce the notion of *m*-polar fuzzy graph structure and present various operations, including Cartesian product, strong product, cross product, lexicographic product, composition, union and join of *m*-polar fuzzy graph structures. We illustrate these operations by several examples. We also investigate some of their related properties.

## Keywords

*m*-Polar fuzzy graph structure (

*m*-PFGSs)CompositionCartesian productStrong productCross productLexicographic productJoinUnion of two

*m*-PFGSs

## Mathematics Subject Classification

## Background

Graph theory have applications in many areas of computer science including data mining, image segmentation, clustering, image capturing, networking. A graph structure, introduced by Sampathkumar (2006), is a generalization of undirected graph which is quite useful in studying some structures including graphs, signed graphs, graphs in which every edge is labeled or colored. A graph structure helps to study the various relations and the corresponding edges simultaneously.

A fuzzy set (Zadeh 1965) is an important mathematical structure to represent a collection of objects whose boundary is vague. Fuzzy models are becoming useful because of their aim in reducing the differences between the traditional models used in engineering and science. Nowadays fuzzy sets are playing a substantial role in chemistry, economics, computer science, engineering, medicine and decision making problems. In 1998, Zhang (1998) generalized the idea of a fuzzy set and gave the concept of bipolar fuzzy set on a given set *X* as a map which associates each element of *X* to a real number in the interval \([-1,1].\) In 2014, Chen et al. (2014) introduced the idea of *m*-polar fuzzy sets as an extension of bipolar fuzzy sets and showed that bipolar fuzzy sets and 2-polar fuzzy sets are cryptomorphic mathematical notions and that we can obtain concisely one from the corresponding one in Chen et al. (2014). The idea behind this is that “multipolar information” (not just bipolar information which corresponds to two-valued logic) exists because data for a real world problem are sometimes from *n* agents \((n\ge 2)\). For example, the exact degree of telecommunication safety of mankind is a point in \([0,1]^n (n\approx 7\times 10^9)\) because different person has been monitored different times. There are many examples such as truth degrees of a logic formula which are based on *n* logic implication operators \((n\ge 2)\), similarity degrees of two logic formula which are based on *n* logic implication operators \((n\ge 2)\), ordering results of a magazine, ordering results of a university and inclusion degrees (accuracy measures, rough measures, approximation qualities, fuzziness measures, and decision preformation evaluations) of a rough set.

Kauffman (1973) gave the definition of a fuzzy graph in 1973 on the basis of Zadeh’s fuzzy relations (Zadeh 1971). Rosenfeld (1975) discussed the idea of fuzzy graph in 1975. Further remarks on fuzzy graphs were given by Bhattacharya (1987). Several concepts on fuzzy graphs were introduced by Mordeson and Nair (2001). Akram *et al.* has discussed and introduced bipolar fuzzy graphs, regular bipolar fuzzy graphs, properties of bipolar fuzzy hypergraphs, bipolar fuzzy graph structures and bipolar fuzzy competition graphs in Akram (2011, (2013), Akram and Dudek (2012), Akram et al. (2013), Akram and Akmal (2016) and Al-Shehrie and Akram (2015). In 2015, Akram and Younas studied certain types of irregular *m*-polar fuzzy graphs in Akram and Younas (2016). Akram and Adeel studied m-polar fuzzy line graphs in Akram and Adeel (2016). Akram and Waseem introduced certain metrics in m-polar fuzzy graphs in Akram and Waseem (2016). Dinesh (2014) introduced the notion of a fuzzy graph structure and discussed some related properties. Akram and Akmal (2016) introduced the concept of bipolar fuzzy graph structures. In this research article, we introduce the notion of *m*-polar fuzzy graph structure and present various operations, including Cartesian product, strong product, cross product, lexicographic product, composition, union and join of *m*-polar fuzzy graph structures. We illustrate these operations by several examples. We also investigate some of their related properties. We have used standard definitions and terminologies in this paper. For other notations, terminologies and applications not mentioned in the paper, the readers are referred to Dinesh and Ramakrishnan (2011), Lee (2000) and Zhang (1994).

## Preliminaries

In this section, we review some basic concepts that are necessary for fully benefit of this paper.

In 1965, Zadeh (1965) introduced the notion of a fuzzy set as follows.

###
**Definition 1**

(Zadeh 1965, 1971) A *fuzzy set*
\(\mu \) in a universe *X* is a mapping \(\mu :X\rightarrow [0,1]\). A *fuzzy relation* on *X* is a fuzzy set \(\nu \) in \(X \times X\). Let \(\mu \) be a fuzzy set in *X* and \(\nu \) fuzzy relation on *X*. We call \(\nu \) is a fuzzy relation on \(\mu \) if \(\nu (x, y) \le \)
\(\min \{\mu (x), \mu (y)\}\, \forall x, y \in X\).

Recently, Akram and Akmal (2016) applied the concept of bipolar fuzzy sets to graph structures.

###
**Definition 2**

*bipolar fuzzy graph structure*(BFGS) of a graph structure (GS) \(G^*=(U,E_{1},E_{2},\ldots ,E_{n})\) if \(M=(\mu ^{P}_{M},\mu ^{N}_{M})\) is a

*bipolar fuzzy set on*

*U*and for each \(i=1,2,\ldots ,n,\) \(N_{i}=(\mu ^{P}_{N_i},\mu ^{N}_{N_i})\) is a

*bipolar fuzzy set on*\(E_{i}\) such that

*U*and \(E_i\,(i=1,2,\ldots ,n)\) are called

*underlying vertex set*and

*underlying*

*i*

*-edge sets*of \(\check{G_b}\), respectively.

###
**Definition 3**

(Akram and Akmal 2016) Let \(\check{G_{b}}=(M,N_{1},N_{2},\ldots ,N_{n})\) be a BFGS of a *GS*
\(G^*=(U,E_{1},E_{2},\ldots ,E_{n}).\) Let \(\phi \) be any permutation on the set \(\{E_{1},E_{2},\ldots ,E_{n}\}\) and the corresponding permutation on \(\{N_{1},N_{2},\ldots ,N_{n}\},\) i.e., \(\phi (N_{i})=N_{j}\) if and only if \(\phi (E_{i})=E_{j}\,\forall i.\)

*r*and

*m*is chosen such that \(\mu ^P_{N^\phi _{m}}(xy)\ge \mu ^P_{N^\phi _{i}} (xy)\,and\,\mu ^{N}_{N^\phi _{m}}(xy)\le \mu ^{N}_{N^\phi _{i}}(xy)\,\forall i.\)

And BFGS \((M,{N^\phi _{1}},{N^\phi _{2}},\ldots ,{N^\phi _{n}})\) denoted by \(\check{G}^{\phi c}_{b},\) is called the \(\phi \)-*complement of BFGS*
\(\check{G_{b}}.\)

Chen et al. (2014) introduced the notion of *m*-polar fuzzy set as a generalization of a bipolar fuzzy set.

###
**Definition 4**

(Chen et al. 2014) An *m*
*-polar fuzzy set* (or a \([0,1]^m\)-set) on *X* is exactly a mapping \(A:X\rightarrow [0,1]^m.\)

Note that \([0, 1]^m\) (*m*th-power of [0, 1]) is considered as a poset with the point-wise order \(\le \), where *m* is an arbitrary ordinal number (we make an appointment that \(m= \{n | n < m \}\) when \(m>0\)), \(\le \) is defined by \(x \le y\Leftrightarrow p_i(x) \le p_i(y)\) for each \(i \in m\) ( \(x, y \in [0, 1]^m)\), and \(p_i : [0, 1]^m \rightarrow [0, 1]\) is the *i*th projection mapping \((i \in m)\). \({\mathbf 0}=(0,0,\ldots , 0)\) is the smallest element in \([0,1]^m\) and \({\mathbf 1}=(1,1,\ldots ,1)\) is the largest element in \([0,1]^m\). Akram and Waseem (2016) defined *m*-polar fuzzy relation as follows.

###
**Definition 5**

(Akram and Waseem 2016) Let *C* be an *m*-polar fuzzy subset of a non-empty set *V*. An *m*
*-polar fuzzy relation* on *C* is an *m*-polar fuzzy subset *D* of \(V\times V\) defined by the mapping \(D:V\times V\rightarrow [0,1]^m\) such that for all \(x,\,y\in V,p_i\circ D(xy)\le \inf \{p_i\circ C(x),p_i\circ C(y)\},\,i=1,2,\ldots ,m,\) where \(p_i\circ C(x)\) denotes the *i*th degree of membership of the vertex *x* and \(p_i\circ D(xy)\) denotes the *i*th degree of membership of the edge *xy*.

An *m*-polar fuzzy graph was introduced by Chen et al. (2014) and modified by Akram and Waseem (2016).

###
**Definition 6**

*m*

*-polar fuzzy graph*is a pair \(G=(C,D)\), where \(C:V\rightarrow [0,1]^m\) is an

*m*-polar fuzzy set in

*V*and \(D: V \times V\rightarrow [0,1]^m\) is an

*m*-polar fuzzy relation on

*V*such that

We note that \(p_i\circ D(xy)=0\) for all \(xy\in V\times V-E\) for all \(i=1,2,3,\ldots ,m.\)
*C* is called the *m*
*-polar fuzzy vertex set* of *G* and *D* is called the *m*
*-polar fuzzy edge set* of *G*, respectively. An *m*-polar fuzzy relation *D* on *V* is called symmetric if \(p_i\circ D(xy)=p_i\circ D(yx)\) for all \(x,y\in V.\)

##
*m*-Polar fuzzy graph structures

We first define the concept of an *m*-polar fuzzy graph structure.

###
**Definition 7**

*C*be an

*m*-polar fuzzy set on

*U*and \(D_i\) an

*m*-polar fuzzy set on \(E_i\) such that

*m*-

*polar fuzzy graph structure*(

*m*-PFGS) on \(G^*\) where

*C*is the

*m*-

*polar fuzzy vertex set*of \(G_{(m)}\) and \(D_i\) is the

*m*-

*polar fuzzy*

*i*

*-edge set*of \(G_{(m)}\).

We illustrate the concept of an *m*-polar fuzzy graph structure with an example.

###
*Example 8*

Consider a graph structure \(G^*=(U,E_{1},E_{2})\) such that \(U=\{a_1,a_2,a_3,a_4\}\), \(E_1=\{a_1a_2\}\) and \(E_2=\{a_3a_2,a_2a_4\}.\) Let *C*, \(D_1\) and \(D_2\) be 4-polar fuzzy sets on \(U,\,E_1\) and \(E_2\), respectively, defined by the following tables:

| \(a_1\) | \(a_2\) | \(a_3\) | \(a_4\) |
---|---|---|---|---|

\(p_1\circ C\) | 0.1 | 0.3 | 0.4 | 0.2 |

\(p_2\circ C\) | 0.0 | 0.6 | 0.0 | 0.0 |

\(p_3\circ C\) | 0.0 | 0.2 | 0.4 | 0.3 |

\(p_4\circ C\) | 0.1 | 0.0 | 0.4 | 0.4 |

\(D_i\) | \((a_1a_2)_1\) | \((a_3a_2)_2\) | \((a_2a_4)_2\) | |
---|---|---|---|---|

\(p_1\circ D_i\) | 0.1 | 0.2 | 0.2 | |

\(p_2\circ D_i\) | 0.0 | 0.0 | 0.0 | |

\(p_3\circ D_i\) | 0.0 | 0.2 | 0.2 | |

\(p_4\circ D_i\) | 0.0 | 0.0 | 0.0 |

Note that operations on *m*-polar fuzzy sets are generalization of operations on bipolar fuzzy sets. We apply the concept of *m*-polar fuzzy sets on some operations of graph structures.

###
**Definition 9**

*m*

*-PFGSs*. Then the

*Cartesian product*of \(G^1_{(m)}\) and \(G^2_{(m)}\) is given by

*j*varies from 1 to

*m*.

We illustrate Cartesian product of \(G^1_{(m)}\) and \(G^2_{(m)}\) with an example.

###
*Example 10*

Let \(G^1_{(m)}=(C',D'_{1},D'_{2})\) be a 4-PFGS of graph structure \(G^*_1=(U',E'_{1},E'_{2})\) where \(U'=\{b_1,b_2,b_3\},\,E'_{1}=\{b_1b_2\}\) and \(E'_{2}=\{b_2b_3\}.\) \(G^1_{(m)}\) is drawn and shown in the Fig. 2.

*i*” with the corresponding degrees of memberships of edge.

We now formulate Cartesian product of \(G^1_{(m)}\) and \(G^2_{(m)}\) as a proposition.

###
**Proposition 11**

*Cartesian product of two*
*m-polar fuzzy graph structures is an*
*m-polar fuzzy graph structure.*

###
*Proof*

Let GS \(G^*=(U_1\times U_2,E_{11}\times E_{21},E_{12}\times E_{22},\ldots ,E_{1n}\times E_{2n})\) be the Cartesian product of GSs \(G^*_1=(U_1,E_{11},E_{12},\ldots ,E_{1n})\) and \(G^*_2=(U_2,E_{21},E_{22},\ldots ,E_{2n}).\) Let \(G^1_{(m)}=(C_1,D_{11},D_{12},\ldots ,D_{1n})\) and \(G^2_{(m)}=(C_2,D_{21},D_{22},\ldots ,D_{2n})\) be respective *m*-PFGSs of \(G^*_1\) and \(G^*_2.\) Then \((C_1\times C_2,D_{11}\times D_{21},D_{12}\times D_{22},\ldots ,D_{1n}\times D_{2n})\) is an *m*-PFGS of \(G^*.\)By the Definition 9 of Cartesian product, \(C_1\times C_2\) is an *m*-polar fuzzy set of \(U_1\times U_2\) and \(D_{1i}\times D_{2i}\) is an *m*-polar fuzzy set of \(E_{1i}\times E_{2i}\) for all *i*. So the remaining task is to prove that \(D_{1i}\times D_{2i}\) is an *m*-polar fuzzy relation on \(C_1\times C_2\) for all *i*. For this, some cases are discussed, as follows:

**Case 1**. When \(x\in U_1\) and \(x_2y_2\in E_{2i}\)

**Case 2**. When \(y\in U_2,\,x_1y_1\in E_{1i}\)

We define cross product of \(G^1_{(m)}\) and \(G^2_{(m)}\) by an example.

###
**Definition 12**

*m*

*-PFGSs*. Then the

*cross product*of \(G^1_{(m)}\) and \(G^2_{(m)}\) is given by

*j*varies from 1 to

*m*.

We explain the concept of cross product of two *m*-polar fuzzy graph structures with an example.

###
*Example 13*

Consider the 4-PFGSs \(G_{(m)}\) and \(G^1_{(m)}\) shown in the Figs. 1 and 2, respectively. The cross product of \(G_{(m)}\) and \(G^1_{(m)},\) given by \(G_{(m)}* G^1_{(m)}=(C*C',D_{1}* D'_{1},D_{2}*D'_{2}),\) is as shown in Fig. 4. In the figure, a \(D_{i}*D'_{i}\)-edge can be identified by the subscript “*i*” with the corresponding degrees of memberships of edge.

We formulate cross product of two *m*-polar fuzzy graph structures as a proposition.

###
**Proposition 14**

*Cross product of two m-polar fuzzy graph structures is an*
*m-polar fuzzy graph structure.*

###
*Proof*

Let GS \(G^*=(U_1* U_2,E_{11}* E_{21},E_{12}* E_{22},\ldots ,E_{1n}* E_{2n})\) be the cross product of GSs \(G^*_1=(U_1,E_{11},E_{12},\ldots ,E_{1n})\) and \(G^*_2=(U_2,E_{21},E_{22},\ldots ,E_{2n}).\) If \(G^1_{(m)}=(C_1,D_{11},D_{12},\ldots ,D_{1n})\) and \(G^2_{(m)}=(C_2,D_{21},D_{22},\ldots ,D_{2n})\) are respective *m*-PFGSs of \(G^*_1\) and \(G^*_2\) then \((C_1* C_2,D_{11}* D_{21},D_{12}* D_{22},\ldots ,D_{1n}*D_{2n})\) is an *m*-PFGS of \(G^*.\) By the Definition 12 of cross product, \(C_1* C_2\) and \(D_{1i}* D_{2i}\) are *m*-polar fuzzy sets of \(U_1* U_2\) and \(E_{1i}* E_{2i}\), respectively, for all *i*. So remaining task is to prove that \(D_{1i}* D_{2i}\) is an *m*-polar fuzzy relation on \(C_1* C_2\) for all *i*. For this, proceed as follows:

*m*-polar fuzzy relation on \(C_1* C_2\), for all

*i*, which completes the proof. \(\square \)

We now define lexicographic product of *m*-polar fuzzy graph structures.

###
**Definition 15**

*m*

*-PFGSs*. Then the

*lexicographic product*of \(G^1_{(m)}\) and \(G^2_{(m)}\) is given by

*j*varies from 1 to

*m*.

We explain the concept of lexicographic product of *m*-polar fuzzy graph structures by the following example.

###
*Example 16*

Consider the 4-PFGSs \(G_{(m)}\) and \(G^1_{(m)}\) shown in the Figs. 1 and 2, respectively. The lexicographic product of \(G_{(m)}\) and \(G^1_{(m)},\) given by \(G_{(m)}\bullet G^1_{(m)}=(C\bullet C',D_{1}\bullet D'_{1},D_{2}\bullet D'_{2}),\) is as shown in Fig. 5. In the figure, a \(D_{i}\bullet D'_{i}\)-edge can be identified by the subscript “*i*” with the corresponding degrees of memberships of edge.

We formulate Lexicographic product of two *m*-polar fuzzy graph structures as a proposition.

###
**Proposition 17**

*Lexicographic product of two m-polar fuzzy graph structures is an*
*m-polar fuzzy graph structure.*

###
*Proof*

Let GS \(G^*=(U_1\bullet U_2,E_{11}\bullet E_{21},E_{12}\bullet E_{22},\ldots ,E_{1n}\bullet E_{2n})\) be the lexicographic product of GSs \(G^*_1=(U_1,E_{11},E_{12},\ldots ,E_{1n})\) and \(G^*_2=(U_2,E_{21},E_{22},\ldots ,E_{2n}).\) If \(G^1_{(m)}=(C_1,D_{11},D_{12},\ldots ,D_{1n})\) and \(G^2_{(m)}=(C_2,D_{21},D_{22},\ldots ,D_{2n})\) are respective *m*-PFGSs of \(G^*_1\) and \(G^*_2\) then \((C_1\bullet C_2,D_{11}\bullet D_{21},D_{12}\bullet D_{22},\ldots ,D_{1n}\bullet D_{2n})\) is an *m*-PFGS of \(G^*.\) By the Definition 15 of lexicographic product, \(C_1\bullet C_2\) and \(D_{1i}\bullet D_{2i}\) are *m*-polar fuzzy sets of \(U_1\bullet U_2\) and \(E_{1i}\bullet E_{2i}\), respectively, for all *i*. Now, remaining task is to prove that \(D_{1i}\bullet D_{2i}\) is an *m*-polar fuzzy relation on \(C_1\bullet C_2\) for all *i*. For this, we discuss two cases as follows:

**Case 1**. When \(x\in U_1\) and \(x_2y_2\in E_{2i}\)

**Case 2**. When \(x_1y_1\in E_{1i}\) and \(x_2y_2\in E_{2i}\),

*m*-polar fuzzy relation on \(C_1\bullet C_2\), for all

*i*, which completes the proof. \(\square \)

We now give definition of strong product of *m*-polar fuzzy graph structures.

###
**Definition 18**

*m*

*-PFGSs*. Then the

*strong product*of \(G^1_{(m)}\) and \(G^2_{(m)}\) is given by

*j*varies from 1 to

*m*.

We illustrate the idea of strong product of *m*-polar fuzzy graph structures by the following example.

###
*Example 19*

Consider the 4-PFGSs \(G_{(m)}\) and \(G^1_{(m)}\) shown in the Figs. 1 and 2, respectively. The strong product of \(G_{(m)}\) and \(G^1_{(m)},\) given by \(G_{(m)}\boxtimes G^1_{(m)}=(C\boxtimes C',D_{1}\boxtimes D'_{1},D_{2}\boxtimes D'_{2}),\) is as shown in Fig. 6. In the figure, a \(D_{i}\boxtimes D'_{i}\)-edge can be identified by the subscript “*i*” with the corresponding degrees of memberships of edge.

We formulate strong product of \(G^1_{(m)}\) and \(G^2_{(m)}\) as a proposition.

###
**Proposition 20**

*Strong product of two m-polar fuzzy graph structures is an*
*m-polar fuzzy graph structure.*

###
*Proof*

Let GS \(G^*=(U_1\boxtimes U_2,E_{11}\boxtimes E_{21},E_{12}\boxtimes E_{22},\ldots ,E_{1n}\boxtimes E_{2n})\) be the strong product of GSs \(G^*_1=(U_1,E_{11},E_{12},\ldots ,E_{1n})\) and \(G^*_2=(U_2,E_{21},E_{22},\ldots ,E_{2n}).\) Let \(G^1_{(m)}=(C_1,D_{11},D_{12},\ldots ,D_{1n})\) and \(G^2_{(m)}=(C_2,D_{21},D_{22},\ldots ,D_{2n})\) be respective *m*-PFGSs of \(G^*_1\) and \(G^*_2.\) Then \((C_1\boxtimes C_2,D_{11}\boxtimes D_{21},D_{12}\boxtimes D_{22},\ldots ,D_{1n}\boxtimes D_{2n})\) is an *m*-PFGS of \(G^*.\) By Definition 18 of strong product, \(C_1\boxtimes C_2\) is an *m*-polar fuzzy set of \(U_1\boxtimes U_2\) and \(D_{1i}\boxtimes D_{2i}\) is an *m*-polar fuzzy set of \(E_{1i}\boxtimes E_{2i}\) for all *i*. So the remaining task is to prove that \(D_{1i}\boxtimes D_{2i}\) is an *m*-polar fuzzy relation on \(C_1\boxtimes C_2\) for all *i*. For this, some cases are discussed, as follows:

**Case 1**. When \(x\in U_1\) and \(x_2y_2\in E_{2i}\)

**Case 2**. When \(y\in U_2,\,x_1y_1\in E_{1i}\)

**Case 3**. When \(x_1y_1\in E_{1i}\) and \(x_2y_2\in E_{2i}\),

We define the notion of composition of two *m*-polar fuzzy graph structures.

###
**Definition 21**

*m*

*-PFGSs*. Then

*composition*of \(G^1_{(m)}\) and \(G^2_{(m)}\) is given by

*j*varies from 1 to

*m*.

We discuss the notion of composition of two *m*-polar fuzzy graph structures by the following example.

###
*Example 22*

Consider the 4-PFGSs \(G_{(m)}\) and \(G^1_{(m)}\) shown in the Fig. 1 and The composition of \(G_{(m)}\) and \(G^1_{(m)},\) given by \(G_{(m)}\circ G^1_{(m)}=(C\circ C',D_{1}\circ D'_{1},D_{2}\circ D'_{2}),\) is as shown in Fig. 7. In the figure, a \(D_{i}\circ D'_{i}\)-edge can be identified by the subscript “*i*” with the corresponding degrees of memberships of edge.

We present composition of two *m*-polar fuzzy graph structures as a propostion.

###
**Proposition 23**

*Composition of two m-polar fuzzy graph structures is an*
*m-polar fuzzy graph structure.*

###
*Proof*

Let GS \(G^*=(U_1\circ U_2,E_{11}\circ E_{21},E_{12}\circ E_{22},\ldots ,E_{1n}\circ E_{2n})\) be the composition of GSs \(G^*_1=(U_1,E_{11},E_{12},\ldots ,E_{1n})\) and \(G^*_2=(U_2,E_{21},E_{22},\ldots ,E_{2n}).\) Let \(G^1_{(m)}=(C_1,D_{11},D_{12},\ldots ,D_{1n})\) and \(G^2_{(m)}=(C_2,D_{21},D_{22},\ldots ,D_{2n})\) be respective *m*-PFGSs of \(G^*_1\) and \(G^*_2.\) Then \((C_1\circ C_2,D_{11}\circ D_{21},D_{12}\circ D_{22},\ldots ,D_{1n}\circ D_{2n})\) is an *m*-PFGS of \(G^*.\) By Definition 21 of composition, \(C_1\circ C_2\) is an *m*-polar fuzzy set of \(U_1\circ U_2\) and \(D_{1i}\circ D_{2i}\) is an *m*-polar fuzzy set of \(E_{1i}\circ E_{2i}\) for all *i*. Therefore the remaining task is to show that \(D_{1i}\circ D_{2i}\) is an *m*-polar fuzzy relation on \(C_1\circ C_2\) for all *i*. For this, consider the following cases:

**Case 1**. When \(x\in U_1\) and \(x_2y_2\in E_{2i}\)

**Case 2**. When \(y\in U_2,\,x_1y_1\in E_{1i}\)

**Case 3**. When \(x_1y_1\in E_{1i}\) and \(x_2,y_2\in U_{2}\), such that \(x_2\ne y_2\),

We now introduce the concept of union of two *m*-polar fuzzy graph structures.

###
**Definition 24**

*m*

*-PFGSs*. Then

*union*of \(G^1_{(m)}\) and \(G^2_{(m)}\) is given by

*j*varies from 1 to

*m*.

We describe the concept of union of two *m*-polar fuzzy graph structures with an example.

###
*Example 25*

Consider the 4-PFGSs \(G_{(m)}\) and \(G^1_{(m)}\) shown in the Figs. 1 and 2, respectively. The union of \(G_{(m)}\) and \(G^1_{(m)},\) given by \(G_{(m)}\cup G^1_{(m)}=(C\cup C',D_{1}\cup D'_{1},D_{2}\cup D'_{2}),\) is as shown in Fig. 8. In the figure, a \(D_{i}\cup D'_{i}\)-edge can be identified by the subscript “*i*” with the corresponding degrees of memberships of edge.

###
**Proposition 26**

*Union of two m-polar fuzzy graph structures is an*
*m-polar fuzzy graph structure.*

###
*Proof*

Let GS \(G^*=(U_1\cup U_2,E_{11}\cup E_{21},E_{12}\cup E_{22},\ldots ,E_{1n}\cup E_{2n})\) be the union of GSs \(G^*_1=(U_1,E_{11},E_{12},\ldots ,E_{1n})\) and \(G^*_2=(U_2,E_{21},E_{22},\ldots ,E_{2n}).\) Let \(G^1_{(m)}=(C_1,D_{11},D_{12},\ldots ,D_{1n})\) and \(G^2_{(m)}=(C_2,D_{21},D_{22},\ldots ,D_{2n})\) be respective *m*-PFGSs of \(G^*_1\) and \(G^*_2.\) Then \((C_1\cup C_2,D_{11}\cup D_{21},D_{12}\cup D_{22},\ldots ,D_{1n}\cup D_{2n})\) is an *m*-PFGS of \(G^*.\) From the Definition 24 of union, \(C_1\cup C_2\) is an *m*-polar fuzzy set of \(U_1\cup U_2\) and \(D_{1i}\cup D_{2i}\) is an *m*-polar fuzzy set of \(E_{1i}\cup E_{2i}\) for all *i*. So the remaining task is to show that \(D_{1i}\cup D_{2i}\) is an *m*-polar fuzzy relation on \(C_1\cup C_2\) for all *i*. For this, consider following cases:

**Case 1**. When \(x_1x_2\in E_{1i}{\setminus } E_{2i}\), then there are three possibilities (i) \(x_1,x_2\in U_1\) (ii) \(x_1\in U_1,x_2\in U_1\cap U_2\) (ii) \(x_2\in U_1,x_1\in U_1\cap U_2\). So for all \(j\in m\)

**Case 2**. When \(x_1x_2\in E_{2i}{\setminus } E_{1i}\), then there are three possibilities (i) \(x_1,x_2\in U_2\) (ii) \(x_1\in U_2,x_2\in U_1\cap U_2\) (ii) \(x_2\in U_2,x_1\in U_1\cap U_2\). So for all \(j\in m\)

**Case 3**. When \(x_1x_2\in E_{2i}\cap E_{1i}\), then \(x_1,x_2\in U_1\cap U_2\). So

*m*-polar fuzzy relation on \(C_1\cup C_2\) for all

*i*. This completes the proof. \(\square \)

###
**Theorem 27**

*If GS*
\(G^*=(U_1\cup U_2,E_{11}\cup E_{21},E_{12}\cup E_{22},\ldots ,E_{1n}\cup E_{2n})\)
* is the union of GSs*
\(G^*_1=(U_1,E_{11},E_{12},\ldots ,E_{1n})\)
* and*
\(G^*_2=(U_2,E_{21},E_{22},\ldots ,E_{2n}).\)
* Then every*
*m*-PFGS \((C,D_1,D_2,\ldots ,D_n)\)
* of*
\(G^*\)
*is the union of an m-PFGS*
\(G^1_{(m)}\)
* of*
\(G^*_1\)
*and an m-PFGS*
\(G^2_{(m)}\)
* of*
\(G^*_2.\)

###
*Proof*

*m*-polar fuzzy sets on \(U_1,\) \(U_2,\) \(E_{1i}\) and \(E_{2i}\), respectively, for \(i\in n\) if for every

*j*, we define \(C_1,\) \(C_2,\) \(D_{1i}\) and \(D_{2i}\) as:

*m*-polar fuzzy relation on \(C_k\), since

*m*-PFGS of \(G^*_k\) for \(k=1,2\) and

*m*-PFGS \((C,D_1,\ldots ,D_n)\) is union of

*m*-PFGS \(G^1_{(m)}=(C_1,D_{11},D_{12},\ldots ,D_{1n})\) and

*m*-PFGS \(G^2_{(m)}=(C_2,D_{21},D_{22},\ldots ,D_{2n})\). Hence every

*m*-PFGS of \(G^*=\bigcup \nolimits _k G^*_{k},\) is the union of some

*m*-PFGSs of \(G^*_k\) for \(k=1,2.\)□

Finally, we study the concept of join of two *m*-polar fuzzy graph structures.

###
**Definition 28**

*m*

*-PFGSs*such that \(U_1\cap U_2=\emptyset \). Let \(U_{1i}=\{x\in U_1:All\,the\,edges\,incident\,with\,x\,are\,E_{1i}-edges\}\) and \(U_{2i}=\{x\in U_2:All\,the\,edges\,incident\,with\,x\,are\,E_{2i}-edges\}\). Then

*join*of \(G^1_{(m)}\) and \(G^2_{(m)}\) is given by

*j*varies from 1 to

*m*.

###
*Example 29*

Consider the 4-PFGSs \(G_{(m)}\) and \(G^1_{(m)}\) shown in the Figs. 1 and 2, respectively. The join of \(G_{(m)}\) and \(G^1_{(m)},\) given by \(G_{(m)}+ G^1_{(m)}=(C+ C',D_{1}+ D'_{1},D_{2}+ D'_{2}),\) is as shown in Fig. 9. In the figure, a \(D_{i}+ D'_{i}\)-edge can be identified by the subscript “*i*” with the corresponding degrees of memberships of edge.

###
**Proposition 30**

*Let GS*
\(G^*=(U_1+ U_2,E_{11}+ E_{21},E_{12}+ E_{22},\ldots ,E_{1n}+ E_{2n})\)
* be the join of GSs*
\(G^*_1=(U_1,E_{11},E_{12},\ldots ,E_{1n})\)
* and*
\(G^*_2=(U_2,E_{21},E_{22},\ldots ,E_{2n}).\)
* Let*
\(G^1_{(m)}=(C_1,D_{11},D_{12},\ldots ,D_{1n})\)
* and*
\(G^2_{(m)}=(C_2,D_{21},D_{22},\ldots ,D_{2n})\)
*be respective m*-PFGSs of \(G^*_1\)
* and*
\(G^*_2.\)
* Then*
\((C_1+ C_2,D_{11}+ D_{21},D_{12}+ D_{22},\ldots ,D_{1n}+ D_{2n})\)
*is an m*-PFGS of \(G^*.\)

###
*Proof*

From the Definition 28 of Join, \(C_1+ C_2\) is an *m*-polar fuzzy set of \(U_1+ U_2\) and \(D_{1i}+ D_{2i}\) is an *m*-polar fuzzy set of \(E_{1i}+ E_{2i}\) for all *i*. So the remaining task is to show that \(D_{1i}+ D_{2i}\) is an *m*-polar fuzzy relation on \(C_1+ C_2\) for all *i*. For this, consider following cases:

**Case 1**. When \(x_1x_2\in E_{1i}\), then \(x_1,x_2\in U_1\). So

**Case 2**. When \(x_1x_2\in E_{2i}\), then \(x_1,x_2\in U_2\). So

**Case 3**. When \(x_1\in U_{1i},\,x_2\in U_{2i}\), then \(x_1\in U_1,\,x_2\in U_2\). So

*m*-polar fuzzy relation on \(C_1+ C_2\) in all three cases. All cases hold for every \(i\in n.\) This completes the proof. \(\square \)

###
**Theorem 31**

*If GS*
\(G^*=(U_1+ U_2,E_{11}+ E_{21},E_{12}+ E_{22},\ldots ,E_{1n}+ E_{2n})\)
* is the join of GSs*
\(G^*_1=(U_1,E_{11},E_{12},\ldots ,E_{1n})\)
* and*
\(G^*_2=(U_2,E_{21},E_{22},\ldots ,E_{2n}).\)
* Then every strong*
*m*-PFGS \((C,D_1,D_2,\ldots ,D_n)\)
* of*
\(G^*\)
*is the join of a strong m-PFGS of*
\(G^*_1\)
* and a strong*
*m*-PFGS of \(G^*_2.\)□

###
*Proof*

*m*-PFGS of \(G^*\). Define \(C_1,\) \(C_2,\) \(D_{1i}\) and \(D_{2i}\) for every

*j*, as follows:

*m*-polar fuzzy sets on \(U_1,\) \(U_2,\) \(E_{1i}\) and \(E_{2i}\), respectively, for \(i\in n\). For \(k=1,2\), \(D_{ki}\) is an

*m*-polar fuzzy relation on \(C_k\), so \(G^k_{(m)}=(C_k,D_{k1},\ldots ,D_{kn})\) is a strong

*m*-PFGS of \(G^*_k,\) since

*m*-PFGS \((C,D_1,\ldots ,D_n)\) is join of

*m*-PFGS \(G^1_{(m)}=(C_1,D_{11},D_{12},\ldots ,D_{1n})\) and

*m*-PFGS \(G^2_{(m)}=(C_2,D_{21},D_{22},\ldots ,D_{2n})\). Hence a strong

*m*-PFGS of \(G^*=G^*_{1}+G^*_{2}\) is the join of a strong

*m*-PFGSs of \(G^*_1\) and a strong

*m*-PFGSs of \(G^*_2\). Which completes the proof. \(\square \)

## Conclusions

A graph structure is a useful tool in solving the combinatorial problems in different areas of computer science and computational intelligence systems. It helps to study various relations and the corresponding edges simultaneously. We have introduced the notion of *m*-polar fuzzy graph structure, and presented various methods of their construction. We are extending our work to (1) domination in bipolar fuzzy graph structure, (2) bipolar fuzzy soft graph structures, (3) roughness in graph structures, (4) intuitionistic fuzzy soft graph structures, and (5) multiple-attribute decision making methods based on *m*-polar fuzzy graph structures.

## Declarations

### Authors' contributions

The authors have introduced the notion of *m*-polar fuzzy graph structure, and presented various methods of their construction. All authors read and approved the final manuscript.

### Acknowlegements

The authors are thankful to the referees for their valuable comments and suggestions.

### Competing interests

The authors declare that they have no competing interests.

**Open Access**This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.

## Authors’ Affiliations

## References

- Akram M (2011) Bipolar fuzzy graphs. Inf Sci 181:5548–5564View ArticleGoogle Scholar
- Akram M (2013) Bipolar fuzzy graphs with applications. Knowl Based Syst 39:1–8View ArticleGoogle Scholar
- Akram M, Adeel A (2016) m-Polar fuzzy graphs and m-polar fuzzy line graphs. J Discrete Math Sci Cryptogr. doi:10.1080/09720529.2015.1117221 Google Scholar
- Akram M, Dudek WA (2012) Regular bipolar fuzzy graphs. Neural Comput Appl 21(1):197–205View ArticleGoogle Scholar
- Akram M, Dudek WA, Sarwar S (2013) Properties of bipolar fuzzy hypergraphs. Ital J Pure Appl Math 31:426–458Google Scholar
- Akram M, Akmal R (2016) Application of bipolar fuzzy sets in graph structures. Appl Comput Intell Soft Comput 2016:13. doi:10.1155/2016/5859080 View ArticleGoogle Scholar
- Akram M, Waseem N (2016) Certain metrics in \(m\)-polar fuzzy graphs. New Math Nat Comput 12(2):135–155View ArticleGoogle Scholar
- Akram M, Younas HR (2015) Certain types of irregular \(m\)-polar fuzzy graphs. J Appl Math Comput. doi:10.1007/s12190-015-0972-9
- Al-Shehrie NO, Akram M (2015) Bipolar fuzzy competition graphs. Ars Comb 121:385–402Google Scholar
- Bhattacharya P (1987) Some remarks on fuzzy graphs. Pattern Recognit Lett 6:297–302View ArticleGoogle Scholar
- Chen J, Li S, Ma S, Wang X (2014) m-Polar fuzzy sets: an extension of bipolar fuzzy sets. Sci World J 2014:8Google Scholar
- Dinesh T (2011) A study on graph structures, incidence algebras and their fuzzy analogues, Ph.D Thesis submitted to Kannur University, JuneGoogle Scholar
- Dinesh T, Ramakrishnan TV (2011) On generalised fuzzy graph structures. Appl Math Sci 5(4):173–180Google Scholar
- Kauffman A (1973) Introduction a la Theorie des Sous-emsembles Flous, vol 1. Masson, ParisGoogle Scholar
- Lee K-M (2000) Bipolar-valued fuzzy sets and their basic operations. In: Proceedings of international conference, Bangkok, Thailand, pp 307–317Google Scholar
- Mordeson JN, Nair PS (2001) Fuzzy graphs and fuzzy hypergraphs, 2nd edn. Physica Verlag, HeidelbergGoogle Scholar
- Rosenfeld A (1975) Fuzzy graphs. In: Zadeh LA, Fu KS, Shimura M (eds) Fuzzy sets and their applications. Academic Press, New York, pp 77–95Google Scholar
- Sampathkumar E (2006) Generalized graph structures. Bull Kerala Math Assoc 3(2):65–123Google Scholar
- Zadeh LA (1965) Fuzzy sets. Inf Control 8:338–353View ArticleGoogle Scholar
- Zadeh LA (1971) Similarity relations and fuzzy orderings. Inf Sci 3(2):177–200View ArticleGoogle Scholar
- Zhang W-R (1994) Bipolar fuzzy sets and relations: a computational framework forcognitive modeling and multiagent decision analysis. In: Proceedings of IEEE conference, pp 305–309Google Scholar
- Zhang W-R (1998) Bipolar fuzzy sets. In: Proceedings of FUZZ-IEEE, pp 835–840Google Scholar