# Connectivity Analysis of Bipolar Fuzzy Networks

Authors: Shu Gong; Gang Hua; Wei Gao
Journal: Mathematical Problems in Engineering
 (2022)

---

## Abstract

Network connectivity is an important factor in data transmission, information sharing, and network defense, and it is a crucial indicator which determines the performance of a network. When a network node or channel contains uncertainties in both positive and negative aspects, the entire network can be modeled with bipolar fuzzy graphs. This paper analyzes the influence of each vertex on the connectivity of the entire network through the definition of the connected state on the bipolar fuzzy graph. The solid results are given, and the new concepts are applied in campus network connectivity analysis. This approach helps to analyze the hidden dangers of the bipolar network, find the weaknesses in the connection, and prevent network attacks in advance.


---

## Body

## 1. Introduction

In information science, the connectivity of the network and the connected state of each vertex determine the efficiency of the entire network and the corresponding algorithm. For example, in a protein molecular network, the connected state of the apex determines the molecular activity, which affects the working mechanism of the biological system. In federated learning, the status of each device is not like silos which works all the time. In a certain period of time, devices tend to be in a disconnected state, which leads to the need to select a collection of devices that are in working state during each iteration of federated learning. For various reasons of actual needs, network connectivity has become a hot topic in the field of information technology (see Cheung and Bell [1], Yemini et al. [2], Burla et al. [3], Denison et al. [4], Hummer et al. [5], Ma et al. [6], Gong et al. [7], Gao et al. [8, 9], and Kumar et al. [10]).Due to the complexity of the network itself, in many application scenarios involving the uncertainty of vertices and edges, it is necessary to borrow tools and methods of fuzzy mathematics. Since the network itself uses vertices to represent sites and edges represent the connecting channels between sites, this network is a graph structure. When it is necessary to describe the uncertain features in the network, the entire model becomes a fuzzy graph model; that is, the membership function of vertices and edges is used to describe this uncertainty in detail. On the other hand, this uncertainty in fuzzy mathematics can often be divided into positive and negative properties. It is well known that the positive membership function cannot reflect the negative uncertainty of objectives. For example, the membership functionμ1 stands for “like” and μ2 means “dislike” while μ1x=0.7 cannot infer μ2x=0.3. A reasonable approach is to use a negative membership function to describe “dislike.”In modeling, the positive uncertainty corresponds to the positive membership function value, and the negative uncertainty corresponds to the negative membership function value. In this setting, the network model becomes a bipolar fuzzy graph, and different types of uncertainties can use different membership functions and ultimately determine various frameworks of the bipolar fuzzy graph. Common ones include bipolar intuitionistic fuzzy graphs, bipolar Pythagorean fuzzy graphs, and so on (see Akram et al. [11], Atef et al. [12], Mahapatra et al. [13], Talebi et al. [14], Gong and Hua [15], Binu et al. [16], Amanathulla et al. [17], Kalathian et al. [18], Akram and Sattar [19], and Mahapatra et al. [20]).Very recently, several works contribute to bipolar fuzzy sets and bipolar fuzzy graphs from the perspective of theory and application. Mahmood and Ur Rehman [21] introduced a new notation of bipolar complex fuzzy set which is the fusion of bipolar fuzzy set and complex fuzzy set. Jana [22] studied the multiple attribute group decision-making with bipolar fuzzy numbers in terms of multiple attribute border approximation area comparison approach. Poulik et al. [23] determined the upper and lower boundaries of Randic index of bipolar fuzzy graphs. Ali et al. [24] proposed the theory of an innovative hybrid model called the fuzzy bipolar soft expert sets and applied it to COVID-19 applications. Mehmood et al. [25] raised a new trick to solve LR-type fully bipolar fuzzy linear programming problems with equality restrictions. Ozcelik and Nalkiran [26] introduced an evaluation based on the distance from average solution equipped with trapezoidal bipolar fuzzy sets. Cornejo et al. [27] obtained features of the solvability of bipolar max-product fuzzy equations with the standard negation. More related books on bipolar fuzzy graph can be referred to Mathew et al. [28], Pal et al. [29], Akram et al. [30], Chakraverty et al. [31], Chakraverty [32], and Volosencu and Aceves-Fernandez [33].Binu et al. [34] introduced the connectivity status of vertices in fuzzy graph and classified all the vertices by means of its connectivity status. It inspires us to extend these concepts to more fuzzy settings, and in this work, we focus on bipolar fuzzy setting. The contributions of this work are three-fold: first, we introduce the bipolar connectivity status of each vertex and entire network; then, some theoretical results are inferred in light of fuzzy theory and graph theory; and finally, the given tricks are used in campus network connectivity analysis which aims to prevent network attacks in advance.The organization of the rest sections are as follows: we present the basic existing concepts on bipolar fuzzy graph in Section2; new definitions, theoretical results, and proofs are determined in Section 3; a numerical experiment is manifested in Section 4 which simulates university campus network; and finally, the conclusion and remarks are given in the last section.


## 2. Definitions in Bipolar Fuzzy Graph Setting

LetV be a universal set and A=v,μAPv,μANv:v∈V be a bipolar fuzzy set in V with two membership functions μAP:V⟶0,1 and μAN:V⟶−1,0. If B=μBP,μBN is a bipolar fuzzy set in V˜2 where μBPv,v′≤minμAPv,μAPv′, μBNv,v′≥maxμANv,μANv′ for any v,v′∈V˜2, and μBPv,v′=μBNv,v′=0 for any v,v′∈V˜2−E, then G=V,A,B is a bipolar fuzzy graph (BFG) (the corresponding originally graph is called a crisp graph of fuzzy graph). In what follows, we always use ∧ and ∨ instead of minimum and maximum operations, respectively.LetG=V,A,B be a bipolar fuzzy graph. P=v0v1…vk−1vk is a path with length k from x=v0 to y=vk in G which is a sequence of different vertices, where μBPvi−1,vi>0,μBNvi−1,vi<0 for i∈1,…,k. Then,(1)μBPx,yk=supμBPx,v1∧μBPv1,v2∧⋯∧μBPvk−1,y,and(2)μBNx,yk=infμBNx,v1∨μBNv1,v2∨⋯∨μBNvk−1,y.Set(3)CONNGPx,y=supk∈ℕμBPx,yk,CONNGNx,y=infk∈ℕμBNx,yk.Then, the strength of connectedness between arbitraryx,y∈VG in bipolar fuzzy graph G is denoted by(4)CONNGx,y=CONNGPx,y,CONNGNx,y=μBPx,y∞,μBNx,y∞.IfμBPv,v′>0 and μBNv,v′<0 for any v,v′ in G, then the bipolar fuzzy graph G is connected. If μBPv,v′=minμAPv,μAPv′ and μBNv,v′=maxμANv,μANv′ for any v,v′∈V, then the bipolar fuzzy graph G is a complete bipolar fuzzy graph.All edges in bipolar fuzzy graph can be divided into three classes in light of connectedness. An edgevv′ is strong if μBPv,v′≥CONNG−vv′Pv,v′ and μBNv,v′≤CONNG−vv′Nv,v′. If μBPv,v′>CONNG−vv′Pv,v′ and μBNv,v′<CONNG−vv′Nv,v′, then edge vv′ is called α-strong. If μBPv,v′=CONNG−vv′Pv,v′ and μBNv,v′=CONNG−vv′Nv,v′, then the pair v,vv′ is called β-strong.The connectivity index of the bipolar fuzzy graph is defined by Poulik and Ghorai [35], which is formulated by(5)CIBFG=CIBFPG,CIBFNG=∑x,y∈VμAPxμAPyCONNGPx,y,∑x,y∈VμANxμANyCONNGNx,y,where CIBFPG and CIBFNG are positive connectivity index and negative connectivity index of bipolar fuzzy graph G.


## 3. Connectivity Status in a Bipolar Fuzzy Graph

The difference between the general frame fuzzy graph and the bipolar fuzzy graph mainly depends on the membership function that describes the fuzzy characteristics of the negative pole contained in the bipolar fuzzy graph. The membership function determines the fuzzy structure characteristics of the negative pole and thus has a decisive influence on the connectivity of the vertices of the entire fuzzy graph. In this section, we introduce the connectivity parameters for bipolar fuzzy graphs.Definition 1.
LetG=V,A,B be a bipolar fuzzy graph and V=v1,v2,…,vn be the ordered vertex set of G. The connectivity status of a vertex v∈V is defined by(6)CSGv=CSGPv,CSGNv=1n−1∑i=1,vi≠vnCONNGPvi,v,1n−1∑i=1,vi≠vnCONNGNvi,v,where CSGPv and CSGNv are positive connectivity status and negative connectivity status of vertex v, respectively. The connectivity status of bipolar fuzzy graph G is denoted by(7)CSG=CSPG,CSNG=1n∑i=1nCSGPvi,1n∑i=1nCSGNvi,where CSPG and CSNG are positive connectivity status and negative connectivity status of bipolar fuzzy graph G, respectively.
For convenience, we writeCSGv, CSGPv, and CSGNv as CSv, CSPv, and CSNv for short. The minimum positive connectivity status, maximum positive connectivity status, minimum negative connectivity status, and maximum negative connectivity status of bipolar fuzzy graph G are defined by δCSPG=minv∈VGCSGPv, ΔCSPG=maxv∈VGCSGPv, δCSNG=minv∈VGCSGNv and ΔCSNG=maxv∈VGCSGNv, respectively. A bipolar fuzzy graph is positive connectivity status regular if δCSPG=ΔCSPG and positive connectivity status regular if δCSNG=ΔCSNG. Two vertices are said to be of positive equistatus (respectively, negative equistatus) in bipolar fuzzy graph G if they have the same positive connectivity status (respectively, negative connectivity status) in G. Two vertices are said to be of equistatus if they are both positive equistatus and negative equistatus.Example 1.
As depicted in Figure1, V=v1,v2,v3,v4,v5, E=v1v2,v2v3,v3v4,v4v5, μAPvi,μANvi=1,−1 for 1≤i≤5, μBPv1,v2=0.6, μBNv1,v2=−0.5, μBPv2,v3=0.4, μBNv2,v3=−0.7, μBPv3,v4=0.9, μBNv3,v4=−0.1, μBPv4,v5=0.8, μBNv4,v5=−0.1, CONNGPv1,v2=0.6, CONNGNv1,v2=−0.5, CONNGPv1,v3=0.4, CONNGNv1,v3=−0.5, CONNGPv1,v4=0.4, CONNGNv1,v4=−0.1, CONNGPv1,v5=0.4, CONNGNv1,v5=−0.1, CONNGPv2,v3=0.4, CONNGNv2,v3=−0.7, CONNGPv2,v4=0.4, CONNGNv2,v4=−0.1, CONNGPv2,v5=0.4, CONNGNv2,v5=−0.1, CONNGPv3,v4=0.9, CONNGNv3,v4=−0.1, CONNGPv3,v5=0.8, CONNGNv3,v5=−0.1, CONNGPv4,v5=0.8, CONNGNv4,v5=−0.1, CSGv1=0.45,−0.3, CSGv2=0.45,−0.35, CSGv3=0.625,−0.35, CSGv4=0.625,−0.1, CSGv5=0.6,−0.1, and CSG=0.55,−0.24.
Furthermore, we inferδCSPG=0.45, ΔCSPG=0.625, δCSNG=−0.35, and ΔCSNG=−0.1. v1 and v2 are positive equistatus vertices; v3 and v4 are positive equistatus vertices; v2 and v3 are negative equistatus vertices; v4 and v5 are negative equistatus vertices; however, no two vertices are equistatus.
Our first result reveals the relationship between connectivity index and connectivity status of the bipolar fuzzy graph.Figure 1
A bipolar fuzzy graph with five vertices.Theorem 1.
LetG=V,A,B be a bipolar fuzzy graph and V=v1,v2,…,vn be the ordered vertex set of G. Suppose that μAPv=1 and μANv=−1 for any v∈V. Then,(8)CIBFG=∑i=2nCSPvi−∑i=2n−1∑j=i+1nCONNGPvi,vj,∑i=2nCSNvi−∑i=2n−1∑j=i+1nCONNGNvi,vj.Proof of Theorem1. We only prove the negative part, i.e.,(9)CIBFNG=∑i=2nCSNvi−∑i=2n−1∑j=i+1nCONNGNvi,vj.Under the hypothesis of Theorem1, we infer(10)CIBFNG=∑x,y∈VμANxμANyCONNGNx,y=∑x,y∈VCONNGNx,y=CSNv1+CSNv2−CONNGNv1,v2+CSNv3−CONNGNv1,v3+CONNGNv2,v3+⋯+CSNvn−1−CONNGNvn−2,vn−1+⋯+CONNGNv1,vn−1+CSNvn−CONNGNvn,vn−1+⋯+CONNGNv1,vn=∑i=1nCSGNvi−CSGNv1+CONNGNv2,v3+⋯+CONNGNv2,vn−CONNGNv3,v4+⋯+CONNGNv3,vn−⋯−CONNGNvn−2,vn−1+CONNGNvn−2,vn−CONNGNvn−1,vn=∑i=2nCSNvi−∑i=2n−1∑j=i+1nCONNGNvi,vj.For a complete bipolar fuzzy graph, we have the following statements.Theorem 2.
LetG=V,A,B be a bipolar fuzzy graph and V=v1,v2,⋯,vn. Assume that vminP,vmaxP,vminN,vmaxN∈V are four vertices (allow some of them to be the same vertex) satisfying minv∈VGμAPv=μAPvminP, maxv∈VGμAPv=μAPvmaxP, minv∈VGμANv=μANvminN, and maxv∈VGμANv=μANvmaxN. Then, the following statements hold:(1)
CSPvminP=μAPvminP and CSNvmaxN=μANvmaxN(2)
δCSPG=CSGPvminP, ΔCSPG=CSGPvmaxP, δCSNG=CSGNvminN, and ΔCSNG=CSGNvmaxN(3)
IfμAPv,μANv=μAPv′,μANv′, then v and v′ are equistatusProof of Theorem2.(1)
We only verify the negative part. SinceG is a complete bipolar fuzzy graph, we have μBNvmaxN,v=μANvmaxN where v∈VG−vmaxN, and hence(11)CSNvmaxN=1n−1∑v∈VG−vmaxNμBNvmaxN,v=1n−1n−1μANvmaxN=μANvmaxN.(2)
Clearly,minv∈VGCSGPv=CSGPvminP, maxv∈VGCSGPv=CSGPvmaxP, minv∈VGCSGNv=CSGNvminN, and maxv∈VGCSGNv=CSGNvmaxN. Thus, the results follow from the definition of δCSPG, ΔCSPG, δCSNG, and ΔCSNG.(3)
It needs to confirm thatv and v′ with the same positive and negative membership function are both positive equistatus and negative equistatus. We only check the correctness of negative equistatus below.First, we rank all the vertices according to their negative membership function values:−1≤μANvn≤μANvn−1≤⋯≤μANv2≤μANv1≤0. Since μANv=μANv′, we suppose v and v′ are adjacent vertices in the queue. Without loss of generality, assume v,v′=vt,vt+1. If t=1, then in terms of vmaxN=v1, we are done by(12)CSGNv2=1n−1μANv1+n−2μANv2=1n−1μANv1+n−2μANv1=μANv1=CSGNv1.Ift∈2,…,n−1, then μANvt=μANvt+1 and(13)CSGNvt=1n−1∑i=1t−1μANvi+n−tμANvt=1n−1∑i=1t−1μANvi+μANvt+n−t−1μANvt=1n−1∑i=1tμANvi+n−t−1μANvt+1=CSGNvt+1.In all, the Proof of Theorem2 is finished.Before introducing the next theorem, we need to extend the concept of saturated fuzzy cycle raised by Mathew et al. [36] to bipolar setting.Definition 2.
LetG be a connected bipolar fuzzy graph. G is α-saturated (respectively, β-saturated) if each vertex is incident at least one α-strong edge (β-strong edge). G is called saturated if it is both α-saturated and β-saturated. That is to say, at least one α-strong edge and one β-strong edge are incident on every vertex in the bipolar fuzzy graph.Example 2.
As depicted in Figure2, V=v1,v2,v3,v4, E=v1v2,v2v3,v3v4,v4v1,v1v3, μAPv1=μAPv2=μAPv3=μAPv4=1, μANv1=μANv2=μANv3=μANv4=−1, μBPv1,v2=0.6, μBNv1,v2=−0.6, μBPv2,v3=0.4, μBNv2,v3=−0.4, μBPv3,v4=0.6, μBNv3,v4=−0.6, μBPv4,v1=0.4, μBNv4,v1=−0.4, μBPv1,v3=0.2, andμBNv1,v3=−0.2.
Clearly,v1v2 and v3v4 are α-strong edges; v2v3 and v4v1 are β-strong edges; and v1v3 is not strong edge. Hence, G is saturated.Figure 2
A saturated bipolar fuzzy graph.Thereom 3.
LetC=v1v2…vn be a saturated fuzzy cycle with n vertices. For vi∈VCi∈1,…,n, set αiP, βiP, αiN, and βiN as the positive membership value of α-strong edge, positive membership value of β-strong edge, negative membership value of α-strong edge, and negative membership value of β-strong edge incident to vi, respectively. Let Eα be the edge of all α-strong edges in C. Set uminPvminP=argminvivi+1∈EαμBPvi,vi+1, umaxPvmaxP=argmaxvivi+1∈EαμBPvi,vi+1, uminNvminN=argminvivi+1∈EαμBPvi,vi+1, and umaxNvmaxN=argmaxvivi+1∈EαμBNvi,vi+1 (allow some pair of vertices are the same). Then,(1)
CSvi=1/n−1αiP+n−2βiP,1/n−1αiN+n−2βiN, i∈1,…,n(2)
Ifα-strong edges of C have equal positive and negative membership values, then all vertices in C are of equistatus(3)
δCSPG=CSGPuminP=CSGPvminP, ΔCSPG=CSGPumaxP=CSGPvmaxP, δCSNG=CSGNuminN=CSGNvminN, and ΔCSNG=CSGNumaxN=CSGNvmaxNProof of Theorem3. Since every vertex in C has degree exactly 2 in C and for a fixed vertex vi in C, the connectivity of pairs of vertices (contain vi) is determined by β-strong edges except one pair with exactly α-strong edge. Hence, we can obviously check the statement (1) in view of graph theory.For statement (2), if the membership value of arbitraryα-strong edge is equal, then the statement (1) implies that CSPvi and CSNvi are constants for each vi, where i∈1,…,n.Furthermore, the statement (3) is also valid by means of statement (1).Imitating the vertex classification based on the bipolar connectivity index in Poulik and Ghorai [35], we define the vertex type based on the connectivity status in the following.Definition 3.
LetG=V,A,B be a bipolar fuzzy graph and v∈V.(1)
IfCSPG−v<CSPG and CSNG−v>CSNG, then v is called a bipolar connectivity status-reducing vertex(2)
IfCSPG−v>CSPG and CSNG−v<CSNG, then v is called a bipolar connectivity status-enhancing vertex(3)
IfCSPG−v=CSPG and CSNG−v=CSNG, then v is called a bipolar connectivity status-neutral vertex
LetV′⊆V. V′ is a bipolar connectivity status-reducing vertex set if all its vertices are bipolar connectivity status-reducing vertex; V′ is a bipolar connectivity status enhancing vertex set if all its vertices are bipolar connectivity status-enhancing vertex; and V′ is a bipolar connectivity status-neutral vertex set if all its vertices are bipolar connectivity status-neutral vertex.Example 3.
As depicted in Figure3, V=v1,v2,v3,v4,v5, E=v1v2,v2v3,v3v4,v4v1,v2v5,v3v5,v4v5, μAPv1=μAPv2=μAPv3=μAPv4=μAPv5=1, μANv1=μANv2=μANv3=μANv4=μANv5=−1, μBPv1,v2=0.5, μBNv1,v2=−0.5, μBPv2,v3=0.3, μBNv2,v3=−0.8, μBPv3,v4=0.8, μBNv3,v4=−0.3, μBPv4,v1=0.4, μBNv4,v1=−0.5, μBPv2,v5=0.2, μBNv2,v5=−0.9, μBPv3,v5=0.8, μBNv3,v5=−0.1, μBPv4,v5=0.1, μBNv4,v5=−0.9, CONNGPv1,v2=0.5, CONNGNv1,v2=−0.5, CONNGPv1,v3=0.4, CONNGNv1,v3=−0.5, CONNGPv1,v4=0.4, CONNGNv1,v4=−0.5, CONNGPv1,v5=0.4, CONNGNv1,v5=−0.5, CONNGPv2,v3=0.4, CONNGNv1,v5=−0.8, CONNGPv2,v4=0.4, CONNGNv2,v4=−0.9, CONNGPv2,v5=0.4, CONNGNv2,v5=−0.9, CONNGPv3,v4=0.8, CONNGNv2,v5=−0.8, CONNGPv3,v5=0.8, CONNGNv3,v5=−0.8, CONNGPv4,v5=0.8, CONNGNv4,v5=−0.9, CSGv1=0.425,−0.5, CSGv2=0.425,−0.775, CSGv3=0.6,−0.725, CSGv4=0.6,−0.775, CSGv5=0.6,−0.775, and CSG=0.53,−0.71.
Furthermore, we getCONNG−v1Pv2,v3=0.3, CONNG−v1Nv2,v3=−0.8, CONNG−v1Pv2,v4=0.3, CONNG−v1Nv2,v4=−0.9, CONNG−v1Pv2,v5=0.3, CONNG−v1Nv2,v5=−0.9, CONNG−v1Pv3,v4=0.8, CONNG−v1Nv3,v4=−0.8, CONNG−v1Pv3,v5=0.8, CONNG−v1Nv3,v5=−0.8, CONNG−v1Pv4,v5=0.8, CONNG−v1Nv4,v5=−0.9, CSG−v1v2=0.3,−13/15, CSG−v1v3=19/30,−0.8, CSG−v1v4=19/30,−13/15, CSG−v1v5=19/30,−13/15, CSG−v1=0.55,−0.85.
CONNG−v2Pv1,v3=0.4, CONNG−v2Nv1,v3=−0.3, CONNG−v2Pv1,v4=0.4, CONNG−v2Nv1,v4=−0.5, CONNG−v2Pv1,v5=0.4, CONNG−v2Nv1,v5=−0.5, CONNG−v2Pv3,v4=0.8, CONNG−v2Nv3,v4=−0.3, CONNG−v2Pv3,v5=0.8, CONNG−v2Nv3,v5=−0.3, CONNG−v2Pv4,v5=0.8, CONNG−v2Nv4,v5=−0.9, CSG−v2v1=0.4,−13/30, CSG−v2v3=2/3,−0.3, CSG−v2v4=2/3,−17/30, CSG−v2v5=2/3,−17/30, and CSG−v2=0.6,−7/15.
CONNG−v3Pv1,v2=0.5, CONNG−v3Nv1,v2=−0.5, CONNG−v3Pv1,v4=0.4, CONNG−v3Nv1,v4=−0.5, CONNG−v3Pv1,v5=0.2, CONNG−v3Nv1,v5=−0.5, CONNG−v3Pv2,v4=0.4, CONNG−v3Nv2,v4=−0.9, CONNG−v3Pv2,v5=0.2, CONNG−v3Nv2,v5=−0.9, CONNG−v3Pv4,v5=0.2, CONNG−v3Nv4,v5=−0.9, CSG−v3v1=11/30,−0.5, CSG−v3v2=11/30,−23/30, CSG−v3v4=1/3,−23/30, CSG−v3v5=0.2,−23/30, and CSG−v3=19/60,−0.7.
CONNG−v4Pv1,v2=0.5, CONNG−v4Nv1,v2=−0.5, CONNG−v4Pv1,v3=0.3, CONNG−v4Nv1,v3=−0.5, CONNG−v4Pv1,v5=0.3, CONNG−v4Nv1,v5=−0.5, CONNG−v4Pv2,v3=0.3, CONNG−v4Nv2,v3=−0.8, CONNG−v4Pv2,v5=0.3, CONNG−v4Nv2,v5=−0.9, CONNG−v4Pv3,v5=0.8, CONNG−v4Nv3,v5=−0.8, CSG−v4v1=11/30,−0.5, CSG−v4v2=11/30,−11/15, CSG−v4v3=7/15,−0.7, CSG−v4v5=7/15,−11/15, and CSG−v4=5/12,−2/3.
CONNG−v5Pv1,v2=0.5, CONNG−v5Nv1,v2=−0.5, CONNG−v5Pv1,v3=0.4, CONNG−v5Nv1,v3=−0.5, CONNG−v5Pv1,v4=0.4, CONNG−v5Nv1,v4=−0.5, CONNG−v5Pv2,v3=0.4, CONNG−v5Nv2,v3=−0.8, CONNG−v5Pv2,v4=0.4, CONNG−v5Nv2,v4=−0.5, CONNG−v5Pv3,v4=0.8, CONNG−v5Nv3,v4=−0.5, CSG−v5v1=13/30,−0.5, CSG−v5v2=13/30,−0.6, CSG−v5v3=8/15,−0.6, CSG−v5v4=8/15,−0.5, and CSG−v5=29/60,−0.55.
Note thatCSPG−v3<CSPG and CSNG−v3>CSNG; CSPG−v4<CSPG and CSNG−v4>CSNG; CSPG−v5<CSPG and CSNG−v5>CSNG; hence v3, v4, and v5 are bipolar connectivity status-reducing vertices. By CSPG−v1>CSPG and CSNG−v1<CSNG, we infer that v1 is a bipolar connectivity status-enhancing vertex. However, v2 does not belong to any type of vertex.Figure 3
A bipolar fuzzy graph.


## 4. Campus Network Bandwidth Allocation Application

The information management office of each university is responsible for the distribution and scheduling of its network resources, including the purchase of bandwidth, which is allocated to various colleges and common institutions such as libraries, gymnasium, school hospital, and cafeterias. According to the geographic location of each institution in the school, the network topology is shown in Figure4, and the institution corresponding to each vertex is shown in Table 1.Figure 4
Campus topology graph.Table 1
Correspondence between vertices and institutions in campus.
VertexThe corresponding institutionsv1Libraryv2Administration buildingv3Stadiumv4Logistics office and university hospitalv5School of Artv6School of Foreign Languages and Literaturev7School of Economics and Managementv8School of History and Administrationv9Student activity centerv10Student apartments and cafeterias (west area)v11School of Physics and Electronic Informationv12School of Chemical Engineering and Materialsv13School of Life Sciencev14School of Energy and Environment Sciencev15School of Mathematics and Computer Sciencev16School of Geographyv17Student apartments and cafeterias (east area)It can be seen from the topological representation graph that the entire university is divided into two areas: the east area and the west area, centered on the library and the administrative building. The west area is dominated by the schools of humanities and arts, and the east area is dominated by the departments of science and engineering. There are student dormitories and canteens on both sides. It should be noted that this is a simplified topology graph. In the actual campus structure, there are also parks, teaching buildings, lakes, and so on in the circles enclosed by the east and west district schools, which we does not show these facilities all in Figure3.Assume thatμAPv=1 and μANv=−1 for all vertices in this example. Considering the network cable layout of the channel between the vertices, router settings, uplink capacity and downlink capacity, link delay time, arrangement time, and other positive and negative elements, the membership function values of each edge are shown in Figure 4. The connectivities of all pairs of vertices are listed in Table 2.Table 2
Computing the values of connectivities for each pair of vertices.
Vertex pairCONNGP,CONNGNVertex pairCONNGP,CONNGNv1,v21,−0.1v1,v30.5,−0.1v1,v40.5,−0.1v1,v50.6,−0.1v1,v60.6,−0.1v1,v70.5,−0.1v1,v80.5,−0.1v1,v90.5,−0.1v1,v100.5,−0.1v1,v110.9,−0.1v1,v120.9,−0.1v1,v130.8,−0.1v1,v140.9,−0.1v1,v150.7,−0.1v1,v160.8,−0.1v1,v170.5,−0.1v2,v30.5,−0.6v2,v40.5,−0.5v2,v50.6,−0.5v2,v60.6,−0.4v2,v70.5,−0.5v2,v80.5,−0.4v2,v90.5,−0.4v2,v100.5,−0.3v2,v110.9,−0.1v2,v120.9,−0.2v2,v130.8,−0.1v2,v140.9,−0.1v2,v150.7,−0.1v2,v160.8,−0.1v2,v170.5,−0.1v3,v40.5,−0.5v3,v50.5,−0.5v3,v60.5,−0.4v3,v70.5,−0.5v3,v80.5,−0.4v3,v90.5,−0.4v3,v100.5,−0.3v3,v110.5,−0.1v3,v120.5,−0.2v3,v130.5,−0.1v3,v140.5,−0.1v3,v150.5,−0.1v3,v160.5,−0.1v3,v170.5,−0.1v4,v50.5,−0.5v4,v60.5,−0.4v4,v70.5,−0.5v4,v80.5,−0.4v4,v90.5,−0.4v4,v100.5,−0.3v4,v110.5,−0.1v4,v120.5,−0.2v4,v130.5,−0.1v4,v140.5,−0.1v4,v150.5,−0.1v4,v160.5,−0.1v4,v170.5,−0.1v5,v60.6,−0.4v5,v70.5,−0.5v5,v80.5,−0.4v5,v90.5,−0.4v5,v100.5,−0.3v5,v110.6,−0.1v5,v120.6,−0.2v5,v130.6,−0.1v5,v140.6,−0.1v5,v150.6,−0.1v5,v160.6,−0.1v5,v170.5,−0.1v6,v70.5,−0.4v6,v80.5,−0.6v6,v90.5,−0.5v6,v100.5,−0.3v6,v110.6,−0.1v6,v120.6,−0.2v6,v130.6,−0.1v6,v140.6,−0.1v6,v150.6,−0.1v6,v160.6,−0.1v6,v170.5,−0.1v7,v80.5,−0.4v7,v90.5,−0.4v7,v100.5,−0.3v7,v110.5,−0.1v7,v120.5,−0.2v7,v130.5,−0.1v7,v140.5,−0.1v7,v150.5,−0.1v7,v160.5,−0.1v7,v170.5,−0.1v8,v90.5,−0.5v8,v100.5,−0.3v8,v110.5,−0.1v8,v120.5,−0.2v8,v130.5,−0.1v8,v140.5,−0.1v8,v150.5,−0.1v8,v160.5,−0.1v8,v170.5,−0.1v9,v100.8,−0.3v9,v110.5,−0.1v9,v120.5,−0.2v9,v130.5,−0.1v9,v140.5,−0.1v9,v150.5,−0.1v9,v160.5,−0.1v9,v170.5,−0.1v10,v110.5,−0.1v10,v120.5,−0.2v10,v130.5,−0.1v10,v140.5,−0.1v10,v150.5,−0.1v10,v160.5,−0.1v10,v170.5,−0.1v11,v120.9,−0.1v11,v130.8,−0.3v11,v140.9,−0.1v11,v150.7,−0.3v11,v160.8,−0.3v11,v170.5,−0.3v12,v130.8,−0.1v12,v140.9,−0.1v12,v150.7,−0.1v12,v160.8,−0.1v12,v170.5,−0.1v13,v140.8,−0.1v13,v150.7,−0.4v13,v160.8,−0.4v13,v170.5,−0.4v14,v150.7,−0.1v14,v160.8,−0.1v14,v170.5,−0.1v15,v160.7,−0.4v15,v170.5,−0.5v16,v170.5,−0.4In light of Table2, the connectivity status of vertices is determined in Table 3.Table 3
Calculation the connectivity status of vertices.
VertexCSGPv,CSGNvVertexCSGPv,CSGNvVertexCSGPv,CSGNvv1107/160,−0.1v2107/160,−9/32v30.5,−9/32v40.5,−11/40v511/20,−11/40v689/160,−43/160v70.5,−11/40v80.5,−43/160v983/160,−21/80v1083/160,−33/160v1153/80,−3/20v1253/80,−5/32v1351/80,−27/160v1453/80,−0.1v150.6,−13/80v1651/80,−27/160v170.5,−7/40For the bandwidth allocation problem, the average minimum connectivity in the entire network is required so that the connectivity of each vertex is not lower than this minimum threshold. Assuming that the vertex where the college is located also represents the router set by the department, the edge weight represents the corresponding route and the threshold is set to0.5,−9/32. That is to say, it requires CSGPv>0.5 and CSGNv>−9/32. Note that the vertices v3,v4,v7,andv17 do not satisfy CSGPv>0.5, and the vertices v2andv3 do not satisfying CSGNv>−9/32. Therefore, we must focus on these three vertices to enhance their connected state value to achieve the minimum connection constraint. The connected state analysis of the vertices can be used to obtain the correct direction for designing a balanced network.


## 5. Conclusion

In computer networks, there are many negative uncertain factors, such as the delay of the network apex, the capacity limitation of the uplink and the downlink, the status of the queuing sequence, and so on. Since bipolar fuzzy graphs have negative membership functions that specifically describe these negative uncertain factors, bipolar fuzzy graphs are more flexible in specific network applications than general fuzzy graphs.In this paper, we introduce the connectivity status in the bipolar fuzzy graph which reflects the positive and negative connectedness in a connected network for each vertex, as well as the whole network. Its main function is to help us analyze the connectivity strength of each vertex in the bipolar network and find the weakest link in the entire network through the comparison between the vertices to identify security risks, strengthen network disadvantages in time, and prevent possible attacks against network weaknesses.The following contents can be a topic for continued research:(1)
The connectivity status should be further considered in special bipolar graph settings, for instance, bipolar fuzzy incidence graph, bipolar intuitionistic fuzzy graph, and bipolar Pythagoras fuzzy graph(2)
The bipolar connectivity status in specific graph structures should be discussed, such as bipolar planar graph and bipolar cube graph



---

*Source: 6398599-2022-01-19.xml*