t-Norm Fuzzy Incidence Graphs

: It is the case that, in certain applications of fuzzy graphs, a t-norm, instead of a minimum, is more suitable. This requires the development of a new theory of fuzzy graphs involving an arbitrary t-norm in the basic deﬁnition of a fuzzy graph. There is very little known about this type of fuzzy graph. The purpose of this paper is to further develop this type of fuzzy graph. We concentrate on the relatively new concept of fuzzy incidence graphs.


Introduction
It is well known that Zadeh is the originator of fuzzy logic [1] and that Rosenfeld [2] and Yeh and Bang [3] are the founders of fuzzy graph theory.
It is the case that in certain applications of fuzzy graphs, a t-norm, instead of a minimum, is more suitable.This requires the development of a new theory of fuzzy graphs involving an arbitrary t-norm in the basic definition of a fuzzy graph.There is very little known about this type of fuzzy graph [4].It was shown in [4] that many basic results that hold for fuzzy graphs defined using a minimum do not hold when the minimum is replaced by an arbitrary t-norm.The purpose of this paper is to further develop this type of fuzzy graph.We concentrate on the relatively new concept of fuzzy incidence graphs [5][6][7].It is the goal of this paper to develop results that allow for the use of this new theory by the new concept of fuzzy incidence graphs.The only application of fuzzy incidence graphs up to now has been to problems of human trafficking and illegal immigration [8][9][10][11].The potential for this application is immense as can be seen by the many applications of fuzzy graphs.In fact, it may be useful to describe diffusion closures as in [12].
In relation to illegal immigration, it was shown in [9,10] that the combining of government response measures and vulnerability measures was more suitably accomplished using certain t-norms and t-conorms rather than using minimum and maximum, respectively.This was also determined to be the case in the combining measures of human trafficking flows from one country to another [8,13].We provide a brief example.Let G = (V, E), where V is a set of countries and E is a set of edges.Say V = {u, v, w} and E = {uw, vw}.Define the fuzzy subset σ of V by σ(u) = 0.3, σ(v) = 0.8, and σ(w) = 0.2.Define the fuzzy subset µ of E by µ(uw) = 0.3 ∧ 0.2 = 0.2 and µ(vw) = 0.8 ∧ 0.2 = 0.2., where ∧ denotes minimum.Let σ denote the vulnerability of a country to illegal immigration and let µ denote the risk for illegal immigrants to move from country u to country w and from country v to w.The vulnerability of u and v plays no role in the risk instead of being larger than 0.2.A t-norm, instead of a minimum, would be better used to determine the risk from the vulnerability.For example, if the t-norm product ⊗ were used, then µ(uw) = 0.3 ⊗ 0.2 = 0.06 and µ(vw) = 0.8 ⊗ 0.2 = 0.16.Foundation material and data can be found in [14,15].
In this paper, we show that, if a minimum is replaced by an arbitrary t-norm in the definition of a fuzzy incidence graph, then certain basic results hold while others do not.These results deal with connectedness, paths, cycles, trees, bridges, and cutpairs.We show that an incidence pair (x, xy) can be an incidence cutpair but may be the weakest incidence pair of an incidence cycle.We also show that the following statement is not true: if there is at most one incidence path with the most incidence strength between any vertex and edge of the fuzzy incidence graph G, then G is a fuzzy incidence forest.
The theory of fuzzy graphs is rich in application.In [16], for example, applications to environmental science, social science, geography, and linguistics are shown.Applications to cluster analysis, pattern classification, and database theory have also been noted [11,17].Other application areas include traffic light control [18], traffic control [19], job allocation [20], analysis of a multispecies trawl fishery [21], military applications [22], information networks [23], database theory [11,17], chemical structure [24], group structure [25], and human cardiac function [26].The reader may also find the modern treatment of graph theory and its theoretical developments and algorithmic applications in [13] interesting.
We let ∧ denote a minimum and ∨ denote a maximum.

Incidence
We introduce the notion of the degree of incidence of a vertex and an edge in a fuzzy graph in fuzzy graph theory.We concentrate on incidence, where the edge is adjacent to the vertex.We determine results concerning bridges, cutvertices, cutpairs, fuzzy incidence paths, and a fuzzy incidence tree for fuzzy incidence graphs.In [5,6], Dinesh introduced the notion of the degree of incidence of a vertex and an edge in fuzzy graph theory.Basic results concerning fuzzy graphs can be found in [2,11].
Let V be a finite set and let E denote a subset of P(V), the power set of V, such that every set in E contains exactly two elements.For {x, y} in E, we write xy = {x, y}.Then xy = yx.The elements of V are called vertices, and the elements of E are edges.The pair (V, E) is called a graph.Definition 1.Let (V, E) be a graph.Then G * = (V, E, I) is called an incidence graph, where I ⊆ V × E.

Definition 3.
An incidence subgraph H * of an incidence graph G * is an incidence graph having its vertices, edges, and pairs in G * .
It is important to note that, if (V, E, I) is an incidence graph, then (V ∪ E, I) is a bipartite graph since I ⊆ V × E, where we interpret (u, uv) as an undirected edge between u and uv and so between uv and u also.This leads us to the following definition.
Note that, in the previous definition, we have not required (σ, µ) to be a fuzzy subgraph of (V, E).
Note that, in the previous definition, ν(uv) ≤ τ(u) ∧ τ(v) for u, v ∈ V is not required.Definition 6.Let G * = (V, E, I) be an incidence graph.The sequences are called incidence walks.Then S 1 and S 4 are called closed if v 0 = v n and uv 0 = v n v n+1 , respectively.If the vertices and edges are distinct, then they are called incidence paths.If S 1 and S 4 are closed incidence paths, then they are called incidence cycles.The shortest incidence cycles have three vertices, three edges, and six pairs.
By the definition of a cycle, all pairs of vertices and edges are distinct.Thus, from the definition of an incidence path, if uv is on the path, so are (u, uv), (v, uv), but not an incidence pair of the form (u, vw) with v = u = w.
Let (V, E) be a graph and (V, E, I) an incidence graph.Then I ⊆ V × E. We will assume in the following that ) Incidence pairs of the form (u, vw), where v = u = w, are not allowed here.
Let (V, E) be a graph and (σ, µ) a fuzzy subgraph of (V, E).Let G * = (V, E, I) be an incidence graph.Let (σ, µ, Ψ) be a fuzzy incidence graph.Define σ ∪ µ : . That is, the elements of V ∪ E are the vertices and the elements of E (i) are the edges.This interpretation will aid in the understanding of the proofs to follow.Definition 7.An incidence graph in which all pairs of vertices and all pairs of edges are joined by an incidence path is said to be connected.Definition 8.An incidence graph having no cycles is called an incidence forest.If it is connected, then it is called an incidence tree.
Since a tree is connected, all pairs of vertices are connected by an incidence path.By the definition of an incidence path, if uv is on the path so are (u, uv), (v, uv) but no incidence pair of the form (u, vw) with v = u = w is on the path.
A component in an incidence graph is a maximally connected incidence subgraph.Recall that the definition of connectedness uses a path which, for incidence graphs, involves (u, uv) and (v, uv) for every uv in the path.Thus the removal of a pair (u, uv) can increase the number of components in an incidence graph.For example, consider the incidence graph H has two components, namely {u} and {v, uv, (v, uv)}.

Definition 9.
If the removal of an edge in an incidence graph increases the number of connected components, then the edge is called an incidence bridge.Definition 10.If the removal of a vertex in an incidence graph increases the number of connected components, then the vertex is called an incidence cutvertex.Definition 11.If the removal of an incidence pair in an incidence graph increases the number of connected components, then the incidence pair is called an incidence cutpair.

Fuzzy Incidence
Definition 12. Let ⊗ be a function of the closed interval [0, 1] into itself.If ⊗ satisfies the following properties, it is called a t-norm.For all, a, b, c ∈ [0, 1], In the following ⊗ denotes a t-norm.
Definition 13.Let G * = (V, E) be a graph and σ be a fuzzy subset of V and µ a fuzzy subset of E. Let Ψ be a fuzzy subset of V × E. If Ψ(u, uv) ≤ σ(u) ⊗ µ(uv) for all u ∈ V and uv ∈ E, then Ψ called a fuzzy incidence of G * with respect to ⊗.
Definition 14.Let G * = (V, E) be a graph and (σ, µ) be a fuzzy subgraph of G * with respect to ⊗.If Ψ is a fuzzy incidence of G * , then G = (σ, µ, Ψ) is called a fuzzy incidence subgraph graph of G with respect to ⊗.
Definition 15.Two vertices v i and v j joined by an incidence path in a fuzzy incidence graph are said to be connected.
Example 1.Let G * = (V, E, I) be an incidence graph and G = (σ, µ, Ψ) be a fuzzy incidence graph associated with G * , where V = {v 1 , v 2 , v 3 , v 4 } and is an incidence walk, but not an incidence path since v 2 is repeated.The sequence is an incidence path.The vertices v 1 and v 4 are connected.The incidence strength of this sequence is 0.4 when the t-norm minimum is used.
Let u 0 = u, u n−1 = v, and u n = w.Then a path from u 0 to u n would be The strength of the strongest such path is what is meant in the previous definition.
Then there is an incidence path from x to xy not involving (x, xy) that has incidence strength ≥ Ψ(x, xy).This incidence path together (x, xy) forms an incidence cycle of which (x, xy) is the weakest pair.
A (crisp) incidence graph that has no incidence cycles is called acyclic or an incidence forest.A connected forest is called an incidence tree.A fuzzy incidence graph is called an incidence forest if the graph consisting of its nonzero pairs is a forest and an incidence tree if this graph is connected.We call the fuzzy incidence graph G = (σ, µ, Ψ) a fuzzy incidence forest if it has a partial fuzzy spanning incidence subgraph that is an incidence forest, where for all pairs (x, xy) not in F (Ω(x, xy) = 0), we have Ψ(x, xy) < Ω ∞ ⊗ (x, xy).In other words, if (x, xy) is in G, but not in F, there is an incidence path in F between x and xy whose incidence strength is greater than Ψ(x, xy).It is clear that an incidence forest is a fuzzy incidence forest.
Example 4. Consider the fuzzy incidence graph in Example 3. We note that (σ, µ, Ψ) is an incidence cycle, but not a fuzzy incidence cycle since there is a unique (x, xy) such that It is also the case that (σ, µ, Ψ) is not a fuzzy incidence tree since if it had a fuzzy incidence spanning tree F = (τ, ν, Ω), then Ω ∞ ⊗ (x, xy) = 0.14 > Ψ(x, xy), but this is not the case since Ψ(x, xy) = 0.2.

Theorem 1.
A fuzzy incidence graph with respect to ⊗ is a fuzzy incidence tree if and only if it has a unique maximum fuzzy incidence spanning tree.
Proof.Suppose G = (σ, µ, Ψ) is a fuzzy incidence fuzzy tree with respect to ⊗.Then, G is a fuzzy incidence tree with respect to ∧.Hence, G has a unique maximum fuzzy spanning subgraph with respect to ∧.Let F = (τ, ν, Ω) be a fuzzy incidence spanning subgraph of G with respect to ⊗.
That is, F is a partial fuzzy incidence spanning subgraph of G with respect ∧.We see that if F is a maximum with respect to ⊗, i.e., Ω(x, xy) = Ψ(x, xy), then F is a maximum with respect to ∧ and so is unique for ⊗ since it is unique for ∧.
The following known theorem motivates our next definition.Theorem 2. [2] Let (σ, µ) be a cycle.(σ, µ) is a fuzzy cycle with respect to ∧ if and only if (σ, µ) is not a fuzzy tree with respect to ∧.
We have that (σ, µ, Ψ) of Example 3 is not a fuzzy incidence cycle with respect to ⊗.We see that a fuzzy incidence cycle with respect to ⊗ is a fuzzy incidence cycle with respect to ∧.
Theorem 4. Suppose that (σ, µ, Ψ) is a fuzzy incidence cycle with respect to ∧.Then (σ, µ, Ψ) is a fuzzy incidence cycle with respect to ⊗ if and only if (σ, µ, Ψ) is not a fuzzy incidence tree with respect to ⊗.
Proof.Let w be an incidence cutvertex of G. u, v such that u = w = v such that w is on every strongest u-v incidence path since Ω ∞ ⊗ (u, uv) < Ψ ∞ ⊗ (u, uv).Since G is an incidence cycle, there exists only one strongest incidence path u-v incidence path containing w and all its pairs are incidence cutpairs.Thus, w is a common vertex of two incidence cutpairs.
Example 7. The converse of the previous result is not true.Let G be as defined in Example 3. Then z is a common vertex of the incidence bridges (x, xz) and (y, yz), but z is not an incidence cutvertex since its deletion does not reduce the strength of connectedness between any pair of vertices and edges.
Proof.Suppose that (u, uv) is an incidence cutpair and that Ψ ∞ ⊗ (u, uv) > Ψ(u, uv).Then there is a strongest u − uv incidence path P with incidence strength greater than Ψ(u, uv) and all pairs of this strongest incidence path have incidence strength greater than Ψ(u, uv).x, y such that Ψ ∞ ⊗ (u, uv) < Ψ ∞ ⊗ (u, uv) since (u, uv) is an incidence cutpair.Let Q be a strongest incidence path from x to xy including (u, uv).Then Q − (u, uv) together with P is an incidence path from x to xy that is stronger than Q, a contradiction.Definition 25.Suppose that G = (σ, µ, Ψ) is a fuzzy incidence graph with respect to ⊗. G is called incidence complete if ∀(u, uv) in G, Ψ(u, uv) = σ(u) ⊗ µ(uv).and hence stronger pairs.If this incidence path uses a pair that was deleted after (x, xy), the weakest such pair can be diverted around using a stronger incidence path and hence one with stronger pairs.This process ends in a finite number of steps resulting in F. Since Ψ(x, xy) < Ψ ∞ ⊗ (x, xy), G is a fuzzy incidence forest with respect to ⊗.
Proof.A pair (x, xy) not in F cannot be an incidence cutpair in G since Ψ(x, xy) < Ω ∞ ⊗ (x, xy).Suppose that a pair (x, xy) is a pair in F. Suppose (x, xy) is not an incidence cutpair of G. Then there is an incidence path P in G from x to xy not involving (x, xy) and of incidence strength greater than or equal to Ψ(x, xy).Since P ∪ (x, xy) is an incidence cycle, P must involve pairs not in F, since F is an incidence forest and has no incidence cycles.Let (u, uv) be a pair in P not in F. Now (u, uv) can be replaced by an incidence path P in F from u to uv of incidence strength greater than Ψ(u, uv).Now P cannot contain (x, xy) since all its pairs are strictly greater than Ψ(u, uv) ≥ Ψ(x, xy).Thus, by replacing each such pair (u, uv) by a P , we obtain an incidence cycle in F, contradicting the fact that F is an incidence forest.
Proof.If there are no incidence cycles, the result is trivially true.Suppose (x, xy) is an incidence pair in G that belongs to a fuzzy incidence cycle such that Ψ(x, xy) < Ψ ∞ (x, xy).Let it be the pair with the least value among all such pairs (u, uv) ∈ Supp(Ψ).Delete (x, xy).If there are other incidence cycles, remove incidence pairs in a similar way.At each step, the incidence pair deleted will not have lesser incidence strength than those deleted earlier.After deletion, the remaining fuzzy incidence subgraph is a fuzzy incidence forest F. Therefore, there is an incidence path P from x to xy with more incidence strength than Ψ(x, xy) and not containing (x, xy).If incidence pairs deleted earlier are in P, then we can bypass them using an incidence path with more incidence strength.
Conversely, if G is a fuzzy incidence forest and C any incidence cycle, then by definition, there is an (x, xy) of C not in F such that Ψ(x, xy) < Ω ∞ (x, xy) ≤ Ψ ∞ (x, xy), where F is as in the definition of a fuzzy incidence forest.
Example 10.Example 3 shows that following statement is not true.If there is at most one path with the most incidence strength between any vertex and edge of the fuzzy incidence graph G = (σ, µ, Ψ), then G is a fuzzy incidence forest.
Theorem 11.Let G = (σ, µ, Ψ) be an incidence cycle.Then G is a fuzzy incidence cycle if and only if G is not a fuzzy incidence tree.

Proposition 2 .
Let (σ, µ, Ψ) be a fuzzy incidence graph with respect to t-norms ⊗ and , where ⊗ ⊆ .Let (x, xy) ∈ I.If (x, xy) is an incidence cutpair with respect to , then (x, xy) is an incidence cutpair with respect to ⊗.