Next Article in Journal
Maze Terrain Authoring System in Immersive Virtual Reality for New Visual Realism
Next Article in Special Issue
Elements of Hyperstructure Theory in UWSN Design and Data Aggregation
Previous Article in Journal
Modeling and Optimization of Gaseous Thermal Slip Flow in Rectangular Microducts Using a Particle Swarm Optimization Algorithm
Previous Article in Special Issue
An m-Polar Fuzzy Hypergraph Model of Granular Computing
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A Novel Description on Edge-Regular q-Rung Picture Fuzzy Graphs with Application

1
Department of Mathematics, University of the Punjab, New Campus, Lahore 54590, Pakistan
2
Department of Mathematics, College of Science, Jazan University, New Campus, P.O. Box 2097, Jazan 45142, Saudi Arabia
*
Author to whom correspondence should be addressed.
Symmetry 2019, 11(4), 489; https://doi.org/10.3390/sym11040489
Submission received: 5 March 2019 / Revised: 21 March 2019 / Accepted: 1 April 2019 / Published: 4 April 2019

Abstract

:
Picture fuzzy model is a generalized structure of intuitionistic fuzzy model in the sense that it not only assigns the membership and nonmembership values in the form of orthopair ( μ , ν ) to an element, but it assigns a triplet ( μ , η , ν ) , where η denotes the neutral degree and the difference π = 1 ( μ + η + ν ) indicates the degree of refusal. The q-rung picture fuzzy set( q -RPFS) provides a wide formal mathematical sketch in which uncertain and vague conceptual phenomenon can be precisely and rigorously studied because of its distinctive quality of vast representation space of acceptable triplets. This paper discusses some properties including edge regularity, total edge regularity and perfect edge regularity of q-rung picture fuzzy graphs (q-RPFGs). The work introduces and investigates these properties for square q-RPFGs and q-RPF line graphs. Furthermore, this study characterizes how regularity and edge regularity of q-RPFGs structurally relate. In addition, it presents the concept of ego-networks to extract knowledge from large social networks under q-rung picture fuzzy environment with algorithm.

1. Introduction

Fuzzy sets (FSs), coined by Zadeh [1], have become one of the emerging areas in contemporary technologies of information processing. Recent studies spread across various areas from control, pattern recognition, and knowledge-based systems to computer vision and artificial life. Fuzzy sets implicate capturing, portraying and dealing with linguistic notions-items with indefinite boundaries and thus it came forth as a new approach to incorporate uncertainty. Picture fuzzy sets (PFSs), created by Cuong [2,3], a direct extension of Atanassov’s [4] intuitionistic fuzzy sets (IFSs), which itself extends the Zadeh’s notion of fuzzy sets, are the sets characterized by not only membership μ : X [ 0 , 1 ] , and nonmembership ν : X [ 0 , 1 ] functions but also neutral function η : X [ 0 , 1 ] , where the difference π = 1 ( μ + η + ν ) is called refusal function. Thus PFSs may be satisfactory in cases whenever expert’s evaluations are of types: yes, abstain, no, refusal. Cuong suggested ‘voting’ as a paradigm of his proposed concept. Since picture fuzzy sets are suitable for capturing imprecise, uncertain and inconsistent information, therefore they can be applied to many decision-making processes such as: solution choice, financial forecasting, estimating risks in business etc. Son [5] introduced some clustering algorithms based on picture fuzzy sets with applications to time series and weather forecasting. Thong [6] developed a hybrid model relating picture fuzzy clustering for medical diagnosis. There have been significant attempts which explored this concept, one can see [7,8,9,10,11,12,13]. It is noteworthy that the constraint μ + ν 1 in IFS limits the selection of orthopairs from a triangular region. In order to increase the adeptness of IFS, Yager and Abbasov [14] proposed the notion of Pythagorean fuzzy sets (PyFSs) in 2013 , which replace the constraint of IFS with μ 2 + ν 2 1 . This notion also limits the selection of orthopairs from unit circular region in the first quadrant. In 2017 , Yager [15] introduced q-rung orthopair fuzzy sets (q-ROFSs) as a new generalization of orthopair fuzzy sets (i.e., IFS and PyFS), which further relax the constraint of orthopair membership grades with μ ( x ) q + ν ( x ) q 1 ( q 1 ) . Analogously, since picture fuzzy sets confine the selection of triplets only from a tetrahedron, as shown in Figure 1, the spherical fuzzy sets (SFSs), proposed by Gündoğdu and Kahraman [16], have given strength to the idea of picture fuzzy sets. Although both PFS and SFS can easily reflect the ambiguous character of subjective assessments, they still have apparent variations. The membership functions μ , η , and ν of PFSs are required to meet the condition μ + η + ν 1 . However, these functions in SFSs satisfy the constraint μ 2 + η 2 + ν 2 1 . Which indicates that SFSs somehow expanded the space of admissible triplets. In 2018 , Li et al. [17] proposed the q-RPFS model which inherits the virtues of both q-ROFS and PFS. Being a suitable model for capturing imprecise and inconsistent data, it not only assigns three membership degrees to an element, but also alleviate the constraint of picture and spherical fuzzy sets to a great extent with μ ( u ) q + η ( u ) q + ν ( u ) q 1 ( q 1 ) . Figure 1 shows that the space of admissible triplets expands with increasing q . For example, if an expert provides the positive, neutral and negative membership values to an object as 0.9 , 0.7 and 0.5 , respectively. It is immediately seen that 0.9 + 0.7 + 0.5 1 , and 0.9 2 + 0.7 2 + 0.5 2 1 . Such a case can neither be explained by PFS nor by SFS. However, it is appropriate to use q-RPFS because 0.9 q + 0.7 q + 0.5 q 1 for sufficiently large value of q . Thus immense number of triplets are qualified for q-RPF model due to its elastic bounding constraint. It can be observed that the surface μ ( u ) q + η ( u ) q + ν ( u ) q 1 bounds a portion of first octant, whose volume approaches to the unit cube’s volume as the parameter q approaches to infinity. Of course the constraint condition of q-RPF model provides a sense of interdependence of membership functions μ , η and ν . This fact makes this notion considerably more close to natural world than that of prior notions. Some remarkable attempts can be seen in [18,19,20,21].
Graphs theory, a dynamic field in both theory and applications, allows graphs as the most important abstract data structures in many fields. Graphs can not translate all the phenomenons of real world scenarios adequately due to the uncertainty and vagueness of parameters. These positions direct to define fuzziness in graph theoretic concepts. Zadeh [22] originated the idea of fuzzy relation. Kaufmann [23] introduced fuzzy graph to state uncertainty in networks. Rosenfeld [24] presented more concepts relating fuzzy graphs. Parvathi and Karunambigai introduced intuitionistic fuzzy graphs(IFGs) [25]. Afterward, IFGs were examined by Akram and Davvaz [26]. Naz et al. [27] discussed the notion of Pythagorean fuzzy graphs. Habib et al. [28] investigated q-ROFGs. The flexible nature of these notions make them vast research area, so far in [29,30,31,32,33,34]. To manage the cases requiring opinions of types: yes, abstain, no and refusal in graph-theocratic concepts in a broad manner, recently, Akram and Habib [35] introduced the concept of q-RPFGs and defined their regularity. The concept of regularity of fuzzy graphs has led to many developments in their structural theory as they play important role in combinatorics and theoretical computer science. First, Gani and Radha [36] defined degree, total degree and regularity of fuzzy graphs. Degree and total degree of an edge is introduced by Radha and Kumaravel [37]. Cary [38] initiated the idea of perfectly regular and perfectly edge regular fuzzy graphs. Several related works on regularity and edge regularity can be viewed in [35,39,40,41,42,43,44,45,46]. In this paper, we discuss some properties of q-RPFGs, namely edge regularity, total edge regularity and perfect edge regularity. We introduce and investigate these properties for square q-RPFGs and q-RPF line graphs. Furthermore, we provide a brief characterization on structural relationships between regularity and edge regularity of several q-RPFGs. In addition, we present the idea of ego-networks to extract knowledge from large social networks under q-rung picture fuzzy environment with algorithm, as an application of the proposed concept.
We now review the concept of q-RPFS [17] which is necessary to proceed further.
Definition 1. 
Let X be a universe of discourse. A q-rung picture fuzzy set(q-RPFS) P on X given by
P = { u , μ P ( u ) , η P ( u ) , ν P ( u ) | u X }
is characterized by a positive membership function μ P : X [ 0 , 1 ] , a neutral/abstinence membership function η P : X [ 0 , 1 ] , and a negative membership function ν P : X [ 0 , 1 ] such that 0 μ P q ( u ) + η P q ( u ) + ν P q ( u ) 1 for   all u X . Moreover, π P ( u ) = 1 μ P q ( u ) η P q ( u ) ν P q ( u ) q is called a q-rung picture fuzzy index or degree of refusal membership of u to the set P , where q 1 .
The q-rung picture fuzzy set based models may be satisfactory in conjunctures when human opinions concerning responses: yes, abstain, no, and refusal are encountered. Voting can be considered as a paradigm of such environments as human voters can be split into four classes of those who: vote for, abstain, vote against, refusal of voting. The graphical structure of q-RPFS in Figure 1 provides a gradual increase in spaces bounded by surfaces μ ( x ) q + η ( x ) q + ν ( x ) q = 1 , obtained by varying q in the first octant. For q = 1 , the space bounded by surface x + y + z = 1 in the first octant is equivalent to the volume occupied by a tetrahedron ABCD. For q = 2 , the q-RPFS reduces to spherical fuzzy set which covers more space of acceptable triplets than PFS as it is bounded by surface x 2 + y 2 + z 2 = 1 in the first octant, which is equivalent to the volume occupied by unit sphere in the first octant. It can be seen that for q = 3 , the q-RPFS can accept more triplets than picture and spherical fuzzy sets as it covers up more space and for q = 4 , the space of q-RPFS is vast than all preceding spaces. Since the volume occupied by a surface covers the volume occupied by all prior surfaces; therefore, any element belongs to a particular q-RPFS, must qualify for all picture fuzzy sets of higher rungs (i.e., greater than q).

2. Edge Regular q-Rung Picture Fuzzy Graphs

In this section, we first provide some basic definitions relating regularity of q-RPFGs, defined in [35], which will be used for further developments.
Definition 2. 
A q-rung picture fuzzy graph on a non-empty set X is a pair G = ( P , Q ) with P a q-rung picture fuzzy set on X , and Q a q-rung picture fuzzy relation on X such that
μ Q ( u v ) μ P ( u ) μ P ( v ) , η Q ( u v ) η P ( u ) η P ( v ) , ν Q ( u v ) ν P ( u ) ν P ( v ) ,
and 0 μ Q q ( u v ) + η Q q ( u v ) + ν Q q ( u v ) 1 for all u , v X , where μ Q : X × X [ 0 , 1 ] , η Q : X × X [ 0 , 1 ] and ν Q : X × X [ 0 , 1 ] represents the positive membership, neutral membership, and negative membership functions of Q , respectively.
Example 1. 
Consider a graph G = ( P , Q ) such that P = { a , b , c , d , e } and Q = { a c , a d , b c , b e , c d , c e } P × P . Let P be a 4-RPFS on P and Q be a 4-RPFR on P , defined by
P abcde   Q a c a d b c b e c d c e
μ P 0.80.70.550.70.9   μ Q 0.50.60.550.70.50.5
η P 0.70.850.80.90.4   η Q 0.70.70.80.30.80.25
ν P 0.60.670.770.50.55   ν Q 0.650.60.560.650.660.75
Routine computations show that G = ( P , Q ) , displayed in Figure 2, is a 4-RPFG.
Definition 3. 
Let G = ( P , Q ) be a q-RPFG on underlying crisp graph G = ( P , Q ) . If μ Q ( u v ) = μ P ( u ) μ P ( v ) , η Q ( u v ) = η P ( u ) η P ( v ) and ν Q ( u v ) = ν P ( u ) ν P ( v ) for all u v Q , then G = ( P , Q ) is called a strong q-rung picture fuzzy graph.
Definition 4. 
Let G = ( P , Q ) be a q-RPFG on underlying crisp graph G = ( P , Q ) . If μ Q ( u v ) = μ P ( u ) μ P ( v ) , η Q ( u v ) = η P ( u ) η P ( v ) and ν Q ( u v ) = ν P ( u ) ν P ( v ) for all u , v P , then G = ( P , Q ) is called a complete q-rung picture fuzzy graph.
Definition 5. 
Let G = ( P , Q ) be a q-RPFG defined on G = ( P , Q ) . The order of G is denoted by O ( G ) , and defined as
O ( G ) = u P μ P ( u ) , u P η P ( u ) , u P ν P ( u ) .
Definition 6. 
Let G = ( P , Q ) be a q-RPFG defined on G = ( P , Q ) . The size of G is denoted by S ( G ) , and defined as
S ( G ) = u v P μ Q ( u v ) , u v P η Q ( u v ) , u v P ν Q ( u v ) .
Example 2. 
The order and size of q-rung picture fuzzy graph displayed in Figure 2 are O ( G ) = ( 3.65 , 3.65 , 3.09 ) and S ( G ) = ( 3.35 , 3.55 , 3.12 ) , respectively.
Definition 7. 
Let G = ( P , Q ) be a q-RPFG defined on G = ( P , Q ) . The degree of a vertex u of G is denoted by d G ( u ) = ( d μ ( u ) , d η ( u ) , d ν ( u ) ) , and defined as
d G ( u ) = u v Q μ Q ( u v ) , u v Q η Q ( u v ) , u v Q ν Q ( u v ) .
Definition 8. 
Let G = ( P , Q ) be a q-RPFG defined on G = ( P , Q ) . The total degree of a vertex u of G is denoted by t d G ( u ) = ( t d μ ( u ) , t d η ( u ) , t d ν ( u ) ) , and defined as
t d G ( u ) = u v Q μ Q ( u v ) + μ P ( u ) , u v Q η Q ( u v ) + η P ( u ) , u v Q ν Q ( u v ) + ν P ( u ) .
Example 3. 
Consider a 4-RPFG G displayed in Figure 2. The degree, and total degree of vertex a in G is given as d G ( a ) = ( μ Q ( a c ) + μ Q ( a d ) , η Q ( a c ) + η Q ( a d ) , ν Q ( a c ) + ν Q ( a d ) ) = ( 0.5 + 0.6 , 0.7 + 0.7 , 0.65 + 0.6 ) = ( 1.1 , 1.4 , 1.25 ) , and t d G ( a ) = ( d μ ( a ) + μ P ( a ) , d η ( a ) + η P ( a ) , d ν ( a ) + ν P ( a ) ) = ( 1.1 + 0.8 , 1.4 + 0.7 , 1.25 + 0.6 ) = ( 1.9 , 2.1 , 1.85 ) , respectively.
Definition 9. 
Let G = ( P , Q ) be a q-RPFG defined on G = ( P , Q ) . If each vertex of G has same degree, that is, d G ( u ) = ( k 1 , k 2 , k 3 ) for all u P , then G is called ( k 1 , k 2 , k 3 ) -regular q-RPFG.
Example 4. 
Consider a 3-RPFG G = ( P , Q ) as displayed in Figure 3.
We see that the degree of each vertex in G is d G ( a ) = d G ( b ) = d G ( c ) = ( 0.4 , 0.2 , 1.2 ) . Hence, G is ( 0.2 , 0.1 , 0.6 ) -regular.
Definition 10. 
Let G = ( P , Q ) be a q-RPFG defined on G = ( P , Q ) . If each vertex of G has same total degree, that is, t d G ( u ) = ( l 1 , l 2 , l 3 ) for all u P , then G is called ( l 1 , l 2 , l 3 ) -totally regular q-RPFG.
Example 5. 
Consider a 2-RPFG G = ( P , Q ) as displayed in Figure 4.
G is ( 1.1 , 0.8 , 1.1 ) -totally regular 2-RPFG since t d G ( a ) = t d G ( b ) = t d G ( c ) = t d G ( d ) = ( 1.1 , 0.8 . 1.1 ) .
Definition 11. 
A perfectly regular q-RPFG is a q-RPFG that is both regular and totally regular.
Example 6. 
Consider a 3-rung picture fuzzy graph G = ( P , Q ) as shown in Figure 5.
Clearly, 3-RPFG G is regular since d G ( a ) = d G ( b ) = d G ( c ) = d G ( d ) = ( 0.9 , 1.6 , 2.0 ) , and is totally regular since t d G ( a ) = t d G ( b ) = t d G ( c ) = t d G ( d ) = ( 1.4 , 2.2 , 2.8 ) . Hence, G is perfectly regular 3-RPFG.
Definition 12. 
A q-RPFG G = ( P , Q ) defined on G = ( P , Q ) is said to be partially regular if the underlying graph G = ( P , Q ) is regular.
Definition 13. 
A q-RPFG G = ( P , Q ) defined on G = ( P , Q ) , is said to be full regular if G is both regular, and partially regular.
The concept of edge regularity has been explored by many researchers on fuzzy graphs, and several of its generalizations. We now give a description on edge regular q-RPFGs. First, we state some definitions in this context.
Definition 14. 
Let G = ( P , Q ) be a q-RPFG defined on G = ( P , Q ) . The edge degree of u v in G is denoted by d G ( u v ) = ( d μ ( u v ) , d η ( u v ) , d ν ( u v ) ) , and defined as
d G ( u v ) = d G ( u ) + d G ( v ) 2 ( μ Q ( u v ) , η Q ( u v ) , ν Q ( u v ) ) .
This is equivalent to
d G ( u v ) = u w Q μ Q ( u w ) , u w Q η Q ( u w ) , u w Q ν Q ( u w ) + v w Q μ Q ( v w ) , v w Q η Q ( v w ) , v w Q ν Q ( v w ) 2 ( μ Q ( u v ) , η Q ( u v ) , ν Q ( u v ) ) = w v μ Q ( u w ) , w v η Q ( u w ) , w v ν Q ( u w ) + w u μ Q ( v w ) , w u η Q ( v w ) , w u ν Q ( v w ) .
Example 7. 
Consider a 4-RPFG G displayed in Figure 6.
The degree of edge a d in G can be computed as
d G ( a d ) = d G ( a ) + d G ( d ) 2 ( μ Q ( a d ) , η Q ( a d ) , ν Q ( a d ) ) = ( 1.9 , 1.7 , 1.85 ) + ( 1.26 , 1.1 , 1.12 ) 2 ( 0.6 , 0.7 , 0.6 ) = ( 1.96 , 1.4 , 1.77 ) .
Theorem 1. 
[35] For any q-RPFG G = ( P , Q ) defined on P = { v 1 , v 2 , , v n } , the following relation for degrees of vertices of G must hold:
j = 1 n d G ( v j ) = 2 j = 1 i > j n 1 μ Q ( v j v i ) , j = 1 i > j n 1 η Q ( v j v i ) , j = 1 i > j n 1 ν Q ( v j v i )
for all 1 i n .
The following theorem is developed to define a comprehensive relationship between the degrees of edges, and the degrees of vertices of q-RPFGs.
Theorem 2. 
For any q-RPFG G = ( P , Q ) defined on P = { v 1 , v 2 , , v n } , if ( μ Q ( v i v j ) , η Q ( v i v j ) , ν Q ( v i v j ) ) ( 0 , 0 , 0 ) for all v i , v j P ( i j ) , then the following relation for degrees of edges of G must hold:
i = 1 j > i n 1 d G ( v i v j ) = ( n 2 ) i = 1 n d G ( v i )
for all 1 j n . That is, the sum of degrees of all edges is equal to ( n 2 ) times the sum of degrees of all vertices of G .
Proof 
Let P = { v 1 , v 2 , , v n } , and G = ( P , Q ) be a q-RPFG defined on G = ( P , Q ) . The degree of an edge v i v j of q-RPFG G can be defined as
d G ( v i v j ) = d G ( v i ) + d G ( v j ) 2 ( μ Q ( v i v j ) , η Q ( v i v j ) , ν Q ( v i v j ) ) , i , j = 1 i j n d G ( v i v j ) = i , j = 1 i j n d G ( v i ) + i , j = 1 i j n d G ( v j ) 2 i , j = 1 i j n ( μ Q ( v i v j ) , η Q ( v i v j ) , ν Q ( v i v j ) ) .
For all 1 j n , we have
2 i = 1 j > i n 1 d G ( v i v j ) = ( n 1 ) i = 1 n d G ( v i ) + ( n 1 ) j = 1 n d G ( v j ) 2 2 i = 1 j > i n 1 ( μ Q ( v i v j ) , η Q ( v i v j ) , ν Q ( v i v j ) ) , 2 i = 1 j > i n 1 d G ( v i v j ) = 2 ( n 1 ) i = 1 n d G ( v i ) 2 2 i = 1 j > i n 1 μ Q ( v i v j ) , i = 1 j > i n 1 η Q ( v i v j ) , i = 1 j > i n 1 ν Q ( v i v j ) , 2 i = 1 j > i n 1 d G ( v i v j ) = 2 ( n 1 ) i = 1 n d G ( v i ) 2 i = 1 n d G ( v i ) , using Theorem 1 , i = 1 j > i n 1 d G ( v i v j ) = ( n 2 ) i = 1 n d G ( v i ) .
This completes the proof. □
Next, we state some well known results regarding degrees of edges in q-RPFGs.
Theorem 3. 
Let G = ( P , Q ) be a q-RPFG on a cycle G = ( P , Q ) . Then,
v i P d G ( v i ) = v i v j Q d G ( v i v j ) .
Theorem 4. 
Let G = ( P , Q ) be a q-RPFG on G = ( P , Q ) . Then,
v i v j Q d G ( v i v j ) = v i v j Q d G ( v i v j ) ( μ Q ( v i v j ) , η Q ( v i v j ) , ν Q ( v i v j ) ) ,
where d G ( v i v j ) = d G ( v i ) + d G ( v j ) 2 for all v i , v j P .
Theorem 5. 
Let G = ( P , Q ) be a q-RPFG on a k-regular graph G = ( P , Q ) . Then,
v i v j Q d G ( v i v j ) = 2 ( k 1 ) S ( G ) .
For proofs of above theorems, readers are referred to [37,41,44].
Definition 15. 
The minimum edge degree of q-RPFG G is defined as δ Q ( G ) = ( δ Q μ ( G ) , δ Q η ( G ) , δ Q ν ( G ) ) , where δ Q μ ( G ) = min { d μ ( u v ) : u v Q } is minimum μ-edge degree of G , δ Q η ( G ) = min { d η ( u v ) : u v Q } is minimum η-edge degree of G , and δ Q ν ( G ) = min { d ν ( u v ) : u v Q } is minimum ν-edge degree of G .
Definition 16. 
The maximum edge degree of q-RPFG G is defined as Δ Q ( G ) = ( Δ Q μ ( G ) , Δ Q η ( G ) , Δ Q ν ( G ) ) , where Δ Q μ ( G ) = max { d μ ( u v ) : u v Q } is maximum μ-edge degree of G , Δ Q η ( G ) = max { d η ( u v ) : u v Q } is maximum η-edge degree of G , and Δ Q ν ( G ) = max { d ν ( u v ) : u v Q } is maximum ν-edge degree of G .
Example 8. 
Consider a q-rung picture fuzzy graph G = ( P , Q ) as shown in Figure 6. By routine computations, it is easy to see that the minimum, and maximum edge degree of G are δ Q ( G ) = ( 1.55 , 1.25 , 1.87 ) a n d Δ Q ( G ) = ( 3.01 , 3.1 , 3.95 ) .
Definition 17. 
Let G = ( P , Q ) be a q-RPFG defined on G = ( P , Q ) . The total edge degree of u v in G is denoted by t d G ( u v ) = ( t d μ ( u v ) , t d η ( u v ) , t d ν ( u v ) ) , and defined as
t d G ( u v ) = d G ( u v ) + ( μ Q ( u v ) , η Q ( u v ) , ν Q ( u v ) ) = d G ( u ) + d G ( v ) ( μ Q ( u v ) , η Q ( u v ) , ν Q ( u v ) ) .
This is equivalent to
t d G ( u v ) = w v μ Q ( u w ) , w v η Q ( u w ) , w v ν Q ( u w ) + w u μ Q ( v w ) , w u η Q ( v w ) , w u ν Q ( v w ) + ( μ Q ( u v ) , η Q ( u v ) , ν Q ( u v ) ) .
Example 9. 
Consider a 4-RPFG G displayed in Figure 6. The total degree of edge a d in G can be computed as
t d G ( a d ) = d G ( a d ) + ( μ Q ( a d ) , η Q ( a d ) , ν Q ( a d ) ) = ( 1.96 , 1.4 , 1.77 ) + ( 0.6 , 0.7 , 0.6 ) = ( 2.56 , 2.1 , 2.37 ) .
Theorem 6. 
For any q-RPFG G = ( P , Q ) defined on P = { v 1 , v 2 , , v n } , if ( μ Q ( v i v j ) , η Q ( v i v j ) , ν Q ( v i v j ) ) ( 0 , 0 , 0 ) for all v i , v j P ( i j ) , then the following relation for total degrees of edges of G must hold:
i = 1 j > i n 1 t d G ( v i v j ) = n 3 2 i = 1 n t d G ( v i )
for all 1 j n .
Proof. 
The proof directly follows from Theorem 2 and Definition 17. □
Theorem 7. 
Let G = ( P , Q ) be a q-RPFG on G = ( P , Q ) . Then,
v i v j Q t d G ( v i v j ) = v i v j Q d G ( v i v j ) ( μ Q ( v i v j ) , η Q ( v i v j ) , ν Q ( v i v j ) ) + S ( G ) ,
where d G ( v i v j ) = d G ( v i ) + d G ( v j ) 2 for all v i , v j P .
Proof. 
The total degree of an edge v i v j in a q-RPFG is
t d G ( v i v j ) = d G ( v i v j ) + ( μ Q ( v i v j ) , η Q ( v i v j ) , ν Q ( v i v j ) ) .
Therefore,
v i v j Q t d G ( v i v j ) = v i v j Q ( d G ( v i v j ) + ( μ Q ( v i v j ) , η Q ( v i v j ) , ν Q ( v i v j ) ) ) = v i v j Q d G ( v i v j ) + v i v j Q ( μ Q ( v i v j ) , η Q ( v i v j ) , ν Q ( v i v j ) ) = v i v j Q d G ( v i v j ) ( μ Q ( v i v j ) , η Q ( v i v j ) , ν Q ( v i v j ) ) + S ( G ) ,
where d G ( v i v j ) = d G ( v i ) + d G ( v j ) 2 for all v i , v j P . This completes the proof. □
The concept of edge degree leads to defining edge regularity of q-RPFGs. Formally, we have the following definition:
Definition 18. 
Let G = ( P , Q ) be a q-RPFG defined on G = ( P , Q ) . If each edge of G has same degree, which is
d G ( u v ) = ( p 1 , p 2 , p 3 ) for all u v Q ,
then G is called ( p 1 , p 2 , p 3 ) -edge regular q-RPFG.
Example 10. 
Consider a 3-RPFG G = ( P , Q ) defined on G = ( P , Q ) , where P be a 3-rung picture fuzzy set on P , and Q be a 3-rung picture fuzzy relation on P , defined by
P abc   Q a b b c a c
μ P 0.40.20.9   μ Q 0.20.20.2
η P 0.50.30.1   η Q 0.10.10.1
ν P 0.60.40.6   ν Q 0.60.60.6
We see that d G ( a b ) = d G ( b c ) = d G ( a c ) = ( 0.4 , 0.2 , 1.2 ) . Hence, the 3-RPFG G , displayed in Figure 7, is ( 0.4 , 0.2 , 1.2 ) -edge regular.
Definition 19. 
Let G = ( P , Q ) be a q-RPFG defined on G = ( P , Q ) . If each edge of G has same total edge degree, that is
t d G ( u v ) = ( q 1 , q 2 , q 3 ) for all u v Q ,
then G is called ( q 1 , q 2 , q 3 ) -total edge regular q-RPFG.
Example 11. 
Consider a 3-RPFG G = ( P , Q ) as displayed in Figure 8.
We see that G is ( 1.3 , 1.2 , 0.9 ) -total edge regular 3-RPFG since t d G ( a b ) = t d G ( b c ) = t d G ( a c ) = ( 1.3 , 1.2 . 0.9 ) .
Remark 1. 
1. 
Any connected q-RPFG with two vertices is edge regular.
2. 
A q-RPFG is edge regular if and only if δ Q ( G ) = Δ Q ( G ) .
Remark 2. 
A complete q-rung picture fuzzy graph need not be edge regular.
For example, consider a 4-RPFG G as displayed in Figure 9.
It is clear that G is a complete 4-RPFG. However, G is not edge regular since d G ( a b ) = ( 2.8 , 1.9 , 2.4 ) ( 2.8 , 1.8 , 2.5 ) = d G ( a d ) .
Next, we present a necessary condition for a complete q-RPFG to be edge regular.
Theorem 8. 
Let G = ( P , Q ) be a complete q-rung picture fuzzy graph on G = ( P , Q ) , and μ Q , η Q , and ν Q are constant functions; then, G is an edge regular q-RPFG.
Proof. 
Let G = ( P , Q ) be a complete q-rung picture fuzzy graph defined on G = ( P , Q ) , where P = { u 1 , u 2 , , u n } . Then, for all u , v P , μ Q ( u v ) = μ P ( u ) μ P ( v ) , η Q ( u v ) = η P ( u ) η P ( v ) , and ν Q ( u v ) = ν P ( u ) ν P ( v ) . Let μ Q ( u v ) = c 1 , η Q ( u v ) = c 2 a n d ν Q ( u v ) = c 3 , for all u v Q . The completeness of G implies that each vertex u of G is connected with n 1 vertices by edges, with membership values ( μ Q ( u v ) , η Q ( u v ) , ν Q ( u v ) ) = ( c 1 , c 2 , c 3 ) . Thus, degree of each vertex u P can be written as d G ( u ) = ( n 1 ) ( c 1 , c 2 , c 3 ) . By definition of edge degree, we have
d G ( u v ) = d G ( u ) + d G ( v ) 2 ( μ Q ( u v ) , η Q ( u v ) , ν Q ( u v ) ) = ( n 1 ) ( c 1 , c 2 , c 3 ) + ( n 1 ) ( c 1 , c 2 , c 3 ) 2 ( c 1 , c 2 , c 3 ) = 2 ( n 1 ) ( c 1 , c 2 , c 3 ) 2 ( c 1 , c 2 , c 3 ) = 2 ( ( n 2 ) c 1 , ( n 2 ) c 2 , ( n 2 ) c 3 )
for all u v Q . Hence, G is an edge regular q-RPFG. This completes the proof. □
Remark 3. 
An edge regular q-rung picture fuzzy graph may not be total edge regular.
For example, consider a 6-RPFG G = ( P , Q ) as displayed in Figure 10.
We see that G is edge regular as d G ( a b ) = d G ( a c ) = d G ( b c ) = d G ( b d ) = d G ( c d ) = ( 1.4 , 1.8 , 1.6 ) . However, G is not total edge regular 6-RPFG since t d G ( a b ) = ( 1.8 , 2.3 , 1.9 ) ( 1.7 , 2.2 , 2.1 ) = t d G ( c d ) .
Remark 4. 
A total edge regular q-rung picture fuzzy graph may not be edge regular.
For example, consider a 3-rung picture fuzzy graph G = ( P , Q ) as displayed in Figure 8. We see that G is ( 1.3 , 1.2 , 0.9 ) -total edge regular. However, G is not an edge regular 3-RPFG since d G ( a b ) = ( 0.9 , 0.8 , 0.4 ) ( 0.9 , 0.8 , 0.7 ) = d G ( a c ) .
Moreover, it is easy to observe that there may exist such q-RPFGs which are both edge regular, and total edge regular—neither edge regular nor total edge regular. Thus, there does not exist any relationship between edge regular q-RPFGs, and total edge regular q-RPFGs. Next, we illustrate a theorem providing characterization for edge regularity of q-rung picture fuzzy graphs.
Theorem 9. 
Let G = ( P , Q ) be a q-rung picture fuzzy graph on G = ( P , Q ) , and μ Q , η Q , and ν Q are constant functions; then, the following are equivalent:
(a) 
G is an edge regular q-RPFG.
(b) 
G is a total edge regular q-RPFG.
Proof. 
Let G = ( P , Q ) be a q-RPFG on G = ( P , Q ) . Suppose that, for all u v Q , μ Q ( u v ) = c 1 , η Q ( u v ) = c 2 and ν Q ( u v ) = c 3 . Assume that G is a ( p 1 , p 2 , p 3 ) -edge regular q-RPFG. Then, for all u v Q , d G ( u v ) = ( p 1 , p 2 , p 3 ) . By definition of total edge degree,
t d G ( u v ) = d G ( u v ) + ( μ Q ( u v ) , η Q ( u v ) , ν Q ( u v ) ) = ( p 1 , p 2 , p 3 ) + ( c 1 , c 2 , c 3 ) = ( p 1 + c 1 , p 2 + c 2 , p 3 + c 3 )
for all u v Q . Hence, G is total edge regular q-RPFG.
Conversely, suppose that G is a ( q 1 , q 2 , q 3 ) -total edge regular q-RPFG. Then, by definition of total edge regular
t d G ( u v ) = d G ( u v ) + ( μ Q ( u v ) , η Q ( u v ) , ν Q ( u v ) ) ( q 1 , q 2 , q 3 ) = d G ( u v ) + ( c 1 , c 2 , c 3 ) d G ( u v ) = ( q 1 , q 2 , q 3 ) ( c 1 , c 2 , c 3 ) = ( q 1 c 1 , q 2 c 2 , q 3 c 3 )
for all u v Q . Hence, G is edge regular q-RPFG. This proves that ( a ) and ( b ) are equivalent.
On the other hand, assume that ( a ) , and ( b ) are equivalent. Suppose, on the contrary, that μ Q , η Q , and ν Q are not constant functions. Then, there exist at least one edge x y in Q such that ( μ Q ( u v ) , η Q ( u v ) , ν Q ( u v ) ) ( μ Q ( x y ) , η Q ( x y ) , a n d ν Q ( x y ) ) . Let G be a ( p 1 , p 2 , p 3 ) -edge regular q-RPFG. Then, d G ( u v ) = d G ( x y ) = ( p 1 , p 2 , p 3 ) . Therefore,
t d G ( u v ) = d G ( u v ) + ( μ Q ( u v ) , η Q ( u v ) , ν Q ( u v ) ) = ( p 1 , p 2 , p 3 ) + ( μ Q ( u v ) , η Q ( u v ) , ν Q ( u v ) ) ,
t d G ( x y ) = d G ( x y ) + ( μ Q ( x y ) , η Q ( x y ) , ν Q ( x y ) ) = ( p 1 , p 2 , p 3 ) + ( μ Q ( x y ) , η Q ( x y ) , ν Q ( x y ) ) .
Since ( μ Q ( u v ) , η Q ( u v ) , ν Q ( u v ) ) ( μ Q ( x y ) , η Q ( x y ) , ν Q ( x y ) ) , therefore, t d G ( u v ) t d G ( x y ) . Hence, G is not total edge regular, which gives a contradiction to our assumption.
Now, let G be a total edge regular q-RPFG. Then, by definition of total edge regular,
t d G ( u v ) = t d G ( x y ) , d G ( u v ) + ( μ Q ( u v ) , η Q ( u v ) , ν Q ( u v ) ) = d G ( x y ) + ( μ Q ( x y ) , η Q ( x y ) , ν Q ( x y ) ) , d G ( u v ) d G ( x y ) = ( μ Q ( x y ) , η Q ( x y ) , ν Q ( x y ) ) ( μ Q ( u v ) , η Q ( u v ) , ν Q ( u v ) ) 0 , d G ( u v ) d G ( x y ) .
The fact that G is not edge regular leads a contradiction to our assumption. Hence, μ Q , η Q , and ν Q are constant functions. This completes the proof. □
Definition 20. 
A q-RPFG G = ( P , Q ) defined on G = ( P , Q ) is said to be partially edge regular if the underlying graph G = ( P , Q ) is edge regular.
Example 12. 
Consider a 5-RPFG G = ( P , Q ) displayed in Figure 11a, and its underlying crisp graph G = ( P , Q ) displayed in Figure 11b.
We see that G is 2-edge regular graph. Thus, G is partially edge regular 5-RPFG.
Definition 21. 
A q-RPFG G = ( P , Q ) defined on G = ( P , Q ) is said to be full edge regular if G is both edge regular, and partially edge regular.
Example 13. 
Figure 7 can be considered as an example of full edge regular 3-RPFG. Since G as well as its underlying crisp graph G are edge regular.
Remark 5. 
An edge regular q-rung picture fuzzy graph may not be partially edge regular (or full edge regular).
For example, consider the 6-RPFG G = ( P , Q ) , displayed in Figure 12 a , and its underlying crisp graph G = ( P , Q ) displayed in Figure 12 b .
We see that G is edge regular as d G ( a ) = d G ( b ) = d G ( c ) = d G ( d ) = d G ( e ) = ( 1.2 , 1.2 , 1.6 ) . However, G is not partially edge regular 6-RPFG since its underlying graph G = ( P , Q ) is not edge regular.
Remark 6. 
A partially edge regular q-rung picture fuzzy graph may not be edge regular (or full edge regular).
For example, consider a 5-RPFG G = ( P , Q ) displayed in Figure 11. We see that G is partially edge regular as its underlying graph G is edge regular. However, G is not edge regular 5-RPFG since d G ( a b ) = ( 1.0 , 1.0 , 1.75 ) ( 1.0 , 0.9 , 1.84 ) = d G ( a c ) .
The above remarks show that there does not exist any relationship between edge regular, and partially edge regular (or full edge regular) q-RPFGs. In the following theorem, we develop a relationship between edge regular, and partially edge regular q-RPFGs.
Theorem 10. 
Let G = ( P , Q ) be a q-rung picture fuzzy graph on G = ( P , Q ) . If μ Q , η Q , and ν Q are constant functions, then G is edge regular if and only if G is partially edge regular.
Proof. 
Let G = ( P , Q ) be a q-RPFG such that for all u v Q , μ Q ( u v ) = c 1 , η Q ( u v ) = c 2 and ν Q ( u v ) = c 3 . Then, by definition of edge degree
d G ( u v ) = u w Q w v μ Q ( u w ) , u w Q w v η Q ( u w ) , u w Q w v ν Q ( u w ) + v w Q w u μ Q ( v w ) , v w Q w u η Q ( v w ) , v w Q w u ν Q ( v w ) = u w Q w v ( c 1 , c 2 , c 3 ) + v w Q w u ( c 1 , c 2 , c 3 ) = ( c 1 , c 2 , c 3 ) ( d G ( u ) 1 ) + ( c 1 , c 2 , c 3 ) ( d G ( u ) 1 ) = ( c 1 , c 2 , c 3 ) ( d G ( u ) + d G ( v ) 2 ) = ( c 1 , c 2 , c 3 ) d G ( u v )
for all u v Q . Hence, G is edge regular. Assume that G = ( P , Q ) is a ( p 1 , p 2 , p 3 ) -edge regular q-RPFG. Then, for all u v Q ,
( p 1 , p 2 , p 3 ) = ( c 1 , c 2 , c 3 ) d G ( u v ) , d G ( u v ) = ( p 1 , p 2 , p 3 ) ( c 1 , c 2 , c 3 ) .
This shows that G is an edge regular q-RPFG. Hence, G is partially edge regular q-RPFG.
Conversely, assume that G is partially edge regular q-RPFG. Let G be a p-edge regular graph. Then, for all u v Q , d G ( u v ) = p ( c 1 , c 2 , c 3 ) . Consequently, G is edge regular q-RPFG. This completes the proof. □
Corollary 1. 
Let G = ( P , Q ) be a q-RPFG such that μ Q , η Q , and ν Q are constant functions. If G is an edge regular q-RPFG or a partially edge regular q-RPFG, then G is a full edge regular q-RPFG.
Theorem 11. 
Let G = ( P , Q ) be a strong q-RPFG such that μ P , η P , and ν P are constant functions. Then, G is an edge regular q-RPFG if and only if G is partially edge regular q-RPFG.
Proof. 
Let G = ( P , Q ) be a strong q-RPFG defined on G = ( P , Q ) . Then, for all u v Q , μ Q ( u v ) = μ P ( u ) μ P ( v ) , η Q ( u v ) = η P ( u ) η P ( v ) , and ν Q ( u v ) = ν P ( u ) ν P ( v ) . Let μ P , η P , and ν P be constant functions. Then, for all u P , μ P ( u ) = c 1 , η P ( u ) = c 2 , and ν P ( u ) = c 3 . Combining both facts, we have
μ Q ( u v ) = μ P ( u ) μ P ( v ) = c 1 c 1 = c 1 , η Q ( u v ) = η P ( u ) η P ( v ) = c 2 c 2 = c 2 , ν Q ( u v ) = ν P ( u ) ν P ( v ) = c 3 c 3 = c 3 .
Thus, μ Q , η Q , and ν Q are constant functions. Consequently, the result follows from Theorem 10. □
Corollary 2. 
Let G = ( P , Q ) be a strong q-RPFG such that μ P , η P , and ν P are constant functions. If G is an edge regular q-RPFG or a partially edge regular q-RPFG, then G is a full edge regular q-RPFG.
Next, we state some results regarding order, and size of edge regular q-RPFG.
Theorem 12. 
The size of ( p 1 , p 2 , p 3 ) -edge regular q-RPFG G = ( P , Q ) on a p-edge regular graph G = ( P , Q ) is q ( p 1 , p 2 , p 3 ) p , where q = | Q | .
Theorem 13. 
If G = ( P , Q ) is ( q 1 , q 2 , q 3 ) -total edge regular, and ( r 1 , r 2 , r 3 ) -partially edge regular q-RPFG, then S ( G ) = q ( q 1 , q 2 , q 3 ) ( r 1 , r 2 , r 3 ) + 1 , where q = | Q | .
Theorem 14. 
If G = ( P , Q ) is ( p 1 , p 2 , p 3 ) -edge regular, and ( q 1 , q 2 , q 3 ) -total edge regular q-RPFG, then S ( G ) = q ( q 1 p 1 , q 2 p 2 , q 3 p 3 ) , where q = | Q | .
For proofs of above results, readers are referred to [37,41].

2.1. Perfectly Edge Regular q-RPFGs

In this section, we introduce perfect edge regular q-RPFGs taking as a point of departure the respective definition of perfect edge regular fuzzy graphs by Cary [38].
Definition 22. 
A perfect edge regular q-RPFG is a q-RPFG that is both edge regular, and total edge regular.
Example 14. 
Consider a 5-rung picture fuzzy graph G = ( P , Q ) as shown in Figure 13.
Clearly, G is ( 2.0 , 2.4 , 2.8 ) -edge regular, and ( 2.5 , 3.0 , 3.5 ) -total edge regular. Hence, G is perfect edge regular 5-RPFG.
Theorem 15. 
If G = ( P , Q ) is perfect edge regular q-RPFG, then μ Q , η Q , and ν Q are constant functions.
Proof. 
Let G = ( P , Q ) be a perfect edge regular q-RPFG defined on G = ( P , Q ) . Then, G must be edge regular and total edge regular, i.e., for all u v Q , d G ( u v ) = ( p 1 , p 2 , p 3 ) , and t d G ( u v ) = ( q 1 , q 2 , q 3 ) . By definition of total edge degree,
d G ( u v ) + ( μ Q ( u v ) , η Q ( u v ) , ν Q ( u v ) ) = ( q 1 , q 2 , q 3 ) , ( p 1 , p 2 , p 3 ) + ( μ Q ( u v ) , η Q ( u v ) , ν Q ( u v ) ) = ( q 1 , q 2 , q 3 ) , ( μ Q ( u v ) , η Q ( u v ) , ν Q ( u v ) ) = ( q 1 p 1 , q 2 p 2 , q 3 p 3 ) .
Since μ Q ( u v ) = q 1 p 1 , η Q ( u v ) = q 2 p 2 , and ν Q ( u v ) = q 3 p 3 , for all u v Q , therefore, μ Q , η Q , and ν Q are constant functions. This completes the proof. □
Perfectly edge regular q-RPFGs can be classified by the following theorem.
Theorem 16. 
A q-RPFG G = ( P , Q ) is perfect edge regular if and only if it satisfies the following conditions:
1. 
u w Q μ Q ( u w ) , η Q ( u w ) , ν Q ( u w ) + v w Q μ Q ( v w ) , η Q ( v w ) , ν Q ( v w ) 2 ( μ Q ( u v ) , η Q ( u v ) , ν Q ( u v ) ) = x z Q μ Q ( x z ) , η Q ( x z ) , ν Q ( x z ) + y z Q μ Q ( y z ) , η Q ( y z ) , ν Q ( y z ) 2 ( μ Q ( x y ) , η Q ( x y ) , ν Q ( x y ) ) ,
2. 
( μ Q ( u v ) , η Q ( u v ) , ν Q ( u v ) ) = ( μ Q ( x y ) , η Q ( x y ) , ν Q ( x y ) ) ,
for all u v , x y Q .
Proof. 
Suppose that G = ( P , Q ) is perfect edge regular q-RPFG. Then, it must be regular as well as total edge regular. The fact that G is edge regular implies Condition 1 so that each edge has the same degree. Condition 2 is followed directly by Theorem 15.
Conversely, suppose that Condition 1 and 2 hold. It is straightforward to see that Condition 1 guarantees the edge regularity of G . Let for any two edges u v and x y , d G ( u v ) = d G ( x y ) . By definition of total edge degree,
t d G ( u v ) = d G ( u v ) + ( μ Q ( u v ) , η Q ( u v ) , ν Q ( u v ) ) = d G ( x y ) + ( μ Q ( x y ) , η Q ( x y ) , ν Q ( x y ) ) = t d G ( x y ) .
Thus, G is total edge regular, as u v and x y are arbitrary edges. Consequently, G is perfect edge regular. This completes the proof. □
Remark 7. 
The above theorem does not constitute a sufficient condition for a q-RPFG to be perfect edge regular.
For example, consider a 4-RPFG G as displayed in Figure 14.
We see that ( μ Q ( u v ) , η Q ( u v ) , ν Q ( u v ) ) = ( 0.5 , 0.6 , 0.7 ) , for all u v Q . However, since d G ( a b ) = ( 0.5 , 0.6 , 0.7 ) ( 1.0 , 1.2 , 1.4 ) = d G ( b c ) , and t d G ( a b ) = ( 1.0 , 1.2 , 1.4 ) ( 1.5 , 1.8 , 2.1 ) = t d G ( b c ) , therefore, G is neither edge regular nor totally egde regular. Hence, G is not a perfect edge regular 4-RPFG.
The following theorem provides a necessary condition for the converse of the above theorem to hold.
Theorem 17. 
If G = ( P , Q ) is edge regular q-RPFG, and μ Q , η Q , and ν Q are constant functions, then G is perfect edge regular q-RPFG.
Proof. 
The proof is directly followed from Theorem 9, which proves that G is total edge regular q-RPFG. Moreover, by our assumption, G is edge regular. Hence, G is perfect edge regular. This completes the proof. □
We next illustrate some results relating order and size of perfect edge regular q-RPFG.
Theorem 18. 
If G = ( P , Q ) is perfect edge regular q-RPFG, and μ Q , η Q , and ν Q are constant functions, then the size of G is S ( G ) = ( c 1 , c 2 , c 3 ) | Q | .
Proof. 
Obvious. □
Unlike the order of perfectly regular q-RPFG, we can no longer give an explicit formula for the order of perfect edge regular q-RPFG. However, we can bound its order.
Theorem 19. 
If G = ( P , Q ) is perfect edge regular q-RPFG, then the order of G is bounded as:
u P max u v { μ Q ( u v ) , η Q ( u v ) , ν Q ( u v ) } O ( G ) | P | .
Proof. 
Upper bound of O ( G ) is obvious. We now prove its lower bound. By definition of q-RPFG, μ Q ( u v ) μ P ( u ) μ P ( v ) , η Q ( u v ) η P ( u ) η P ( v ) , and ν Q ( u v ) ν P ( u ) ν P ( v ) . Thus, we have μ P ( u ) max u v μ Q ( u v ) , η P ( u ) max u v η Q ( u v ) , and ν P ( u ) max u v ν Q ( u v ) . For each u P , we obtain
u P max u v { μ Q ( u v ) , η Q ( u v ) , ν Q ( u v ) } u P ( μ P ( u ) , η P ( u ) , μ P ( u ) ) = O ( G ) .
This completes the proof. □

2.2. Edge Regular Square q-RPFGs

Following [47], we define square q-RPFGs. In this section, we concentrate on edge regularity of square q-RPFGs.
Definition 23. 
Let G = ( P , Q ) be a q-RPFG defined on G = ( P , Q ) . The square q-RPFG of G is denoted by S 2 ( G ) = ( P , Q s q ) , and defined as:
1. 
If u v Q , then μ Q s q ( u v ) = μ Q ( u v ) , η Q s q ( u v ) = η Q ( u v ) , and ν Q s q ( u v ) = ν Q ( u v ) .
2. 
If u v Q , and u , v are joined by a path of length less than or equal to 2 in G , then
μ Q s q ( u v ) μ P ( u ) μ P ( v ) , η Q s q ( u v ) η P ( u ) η P ( v ) , ν Q s q ( u v ) ν P ( u ) ν P ( v ) .
Example 15. 
Consider a 6-RPFG G = ( P , Q ) defined on G = ( P , Q ) , where P is a 6-rung picture fuzzy set on P , and Q is a 6-rung picture fuzzy relation on P , defined by
P abcde   Q a b a c a e c d b e
μ P 0.80.820.90.80.6   μ Q 0.80.60.50.80.6
η P 0.750.930.850.70.85   η Q 0.70.60.70.70.8
ν P 0.850.550.590.90.9   ν Q 0.70.60.90.50.6
By routine computations, it is easy to see that S 2 ( G ) = ( P , Q s q ) in Figure 15b is a square 6-rung picture fuzzy graph of G , where the 6-rung picture fuzzy relation Q s q can be defined as follows:
Q s q a b a c a e c d b e c e a d b c
μ Q 0.80.60.50.80.60.60.80.82
η Q 0.70.60.70.70.80.50.70.85
ν Q 0.70.60.90.50.60.90.90.59
The following theorem defines the degree of an edge in square q-RPFG.
Theorem 20. 
For any q-RPFG G = ( P , Q ) , the degree of an edge in its square q-RPFG S 2 ( G ) = ( P , Q s q ) is given by
1. 
For u v Q ,
d S 2 ( G ) ( u v ) = d G ( u v ) + u x Q u x Q s q ( μ P ( u ) μ P ( x ) , η P ( u ) η P ( x ) , ν P ( u ) ν P ( x ) ) + v y Q v y Q s q ( μ P ( v ) μ P ( y ) , η P ( v ) η P ( y ) , ν P ( v ) ν P ( y ) ) .
2. 
For u v Q s q such that u v Q ,
d S 2 ( G ) ( u v ) = d G ( u ) + d G ( v ) + u x Q u x Q s q ( μ P ( u ) μ P ( x ) , η P ( u ) η P ( x ) , ν P ( u ) ν P ( x ) ) + v y Q v y Q s q ( μ P ( v ) μ P ( y ) , η P ( v ) η P ( y ) , ν P ( v ) ν P ( y ) ) 2 ( μ Q s q ( u v ) , η Q s q ( u v ) , ν Q s q ( u v ) ) .
Proof. 
Assume that S 2 ( G ) = ( P , Q s q ) is a square q-RPFG of G = ( P , Q ) .
1.
If u v Q , then by definition of square q-RPFG u v Q s q . The degree of edge u v in S 2 ( G ) is
d S 2 ( G ) ( u v ) = d S 2 ( G ) ( u ) + d S 2 ( G ) ( v ) 2 ( μ Q s q ( u v ) , η Q s q ( u v ) , ν Q s q ( u v ) ) = d G ( u ) + u x Q u x Q s q ( μ Q s q ( u x ) , η Q s q ( u x ) , ν Q s q ( u x ) ) + d G ( v ) + v y Q v y Q s q ( μ Q s q ( v y ) , η Q s q ( v y ) , ν Q s q ( v y ) ) 2 ( μ Q s q ( u v ) , η Q s q ( u v ) , ν Q s q ( u v ) ) = d G ( u ) + d G ( v ) 2 ( μ Q ( u v ) , η Q ( u v ) , ν Q ( u v ) ) ) + u x Q u x Q s q ( μ P ( u ) μ P ( x ) , η P ( u ) η P ( x ) , ν P ( u ) ν P ( x ) ) + v y Q v y Q s q ( μ P ( v ) μ P ( y ) , η P ( v ) η P ( y ) , ν P ( v ) ν P ( y ) ) = d G ( u v ) + u x Q u x Q s q ( μ P ( u ) μ P ( x ) , η P ( u ) η P ( x ) , ν P ( u ) ν P ( x ) ) + v y Q v y Q s q ( μ P ( v ) μ P ( y ) , η P ( v ) η P ( y ) , ν P ( v ) ν P ( y ) ) .
2.
If u v Q s q such that u v Q , then degree of edge u v in S 2 ( G ) is
d S 2 ( G ) ( u v ) = d S 2 ( G ) ( u ) + d S 2 ( G ) ( v ) 2 ( μ Q s q ( u v ) , η Q s q ( u v ) , ν Q s q ( u v ) ) = d G ( u ) + u x Q u x Q s q ( μ Q s q ( u x ) , η Q s q ( u x ) , ν Q s q ( u x ) ) + d G ( v ) + v y Q v y Q s q ( μ Q s q ( v y ) , η Q s q ( v y ) , ν Q s q ( v y ) ) 2 ( μ Q s q ( u v ) , η Q s q ( u v ) , ν Q s q ( u v ) ) = d G ( u ) + d G ( v ) + u x Q u x Q s q ( μ P ( u ) μ P ( x ) , η P ( u ) η P ( x ) , ν P ( u ) ν P ( x ) ) + v y Q v y Q s q ( μ P ( v ) μ P ( y ) , η P ( v ) η P ( y ) , ν P ( v ) ν P ( y ) ) 2 ( μ Q s q ( u v ) , η Q s q ( u v ) , ν Q s q ( u v ) ) .
This completes the proof. □
Remark 8. 
If G = ( P , Q ) is edge regular q-RPFG, then S 2 ( G ) = ( P , Q s q ) may not be edge regular.
For example, consider a 3-RPFG G , and its square graph S 2 ( G ) as shown in Figure 16.
We see that G is ( 1.0 , 0.6 , 1.2 ) -edge regular 3-RPFG. However, since d S 2 ( G ) ( a b ) = ( 2.3 , 1.4 , 2.7 ) ( 2.0 , 1.2 , 2.4 ) = d S 2 ( G ) ( a d ) . Hence, S 2 ( G ) is not edge regular.
Remark 9. 
If S 2 ( G ) = ( P , Q s q ) is edge regular q-RPFG, then G = ( P , Q ) may not be edge regular.
For example, consider a 5-RPFG G , and its square graph S 2 ( G ) as shown in Figure 17.
We see that S 2 ( G ) is ( 2.0 , 2.4 , 2.8 ) -edge regular 5-RPFG. However, since d G ( a b ) = ( 1.5 , 1.8 , 2.1 ) ( 2.0 , 2.4 , 2.8 ) = d G ( a d ) . Hence, G is not edge regular.
Lemma 1. 
The square q-RPFG S 2 ( G ) of a complete q-RPFG G is the q-RPFG G itself.
Proof. 
The proof is obvious. □
Theorem 21. 
If G = ( P , Q ) be complete q-RPFG. Then, G is an edge regular q-RPFG if and only if S 2 ( G ) = ( P , Q s q ) is an edge regular q-RPFG.
Proof. 
Let G = ( P , Q ) be complete q-RPFG. By Lemma 1, G , and S 2 ( G ) are same. It follows that G is an edge regular q-RPFG if and only if S 2 ( G ) = ( P , Q s q ) is an edge regular q-RPFG. □
Lemma 2. 
The square q-RPFG S 2 ( G ) of a complete bipartite q-RPFG G is complete.
Proof. 
Let G = ( P , Q ) be a q-RPFG defined on a complete bipartite graph G = ( P , Q ) . Then, μ Q ( u i v j ) = μ P ( u i ) μ P ( v j ) , η Q ( u i v j ) = η P ( u i ) η P ( v j ) , and ν Q ( u i v j ) = ν P ( u i ) ν P ( v j ) for all u i P 1 , and v j P 2 , where P = P 1 P 2 . Let S 2 ( G ) = ( P , Q s q ) be the square q-RPFG of G . Then, we have the following:
  • If u i v j Q , then μ Q s q ( u i v j ) = μ Q ( u i v j ) , η Q s q ( u i v j ) = η Q ( u i v j ) , and ν Q s q ( u i v j ) = ν Q ( u i v j ) .
  • If u i v j Q , and u , v are joined by a path of length less then or equal to 2 in G , then μ Q s q ( u i v j ) μ P ( u i ) μ P ( v j ) , η Q s q ( u i v j ) η P ( u i ) η P ( v j ) , and ν Q s q ( u i v j ) ν P ( u i ) ν P ( v j ) .
Since each pair of vertices in a complete bipartite graph must connected by a path of length less then or equal to 2 (see Figure 18), therefore, above axioms imply that for all u i , v j P
μ Q s q ( u i v j ) μ P ( u i ) μ P ( v j ) , η Q s q ( u i v j ) η P ( u i ) η P ( v j ) , ν Q s q ( u i v j ) ν P ( u i ) ν P ( v j ) .
Hence, the square q-RPFG S 2 ( G ) is complete. This completes the proof. □
Theorem 22. 
If G = ( P , Q ) is a complete bipartite q-RPFG such that μ P , η P , and ν P are constant functions, then its square graph S 2 ( G ) is edge regular.
Proof. 
Let G = ( P , Q ) be a complete bipartite q-RPFG such that μ P , η P , and ν P are constant functions. Assume that S 2 ( G ) = ( P , Q s q ) is the square q-RPFG of G . Then, by Lemma 2, S 2 ( G ) is a complete q-RPFG.
Let μ P ( u ) = c 1 , η P ( u ) = c 2 , and ν P ( u ) = c 3 for all u P . By definition of square q-RPFG, we have
μ Q s q ( u v ) μ P ( u ) μ P ( v ) = c 1 c 1 = c 1 , η Q s q ( u v ) η P ( u ) η P ( v ) = c 2 c 2 = c 2 , ν Q s q ( u v ) ν P ( u ) ν P ( v ) = c 3 c 3 = c 3 .
Hence, μ Q s q , η Q s q , and ν Q s q are constant functions. Thus, by Theorem 8, S 2 ( G ) is edge regular. This completes the proof. □
Theorem 23. 
If G is a q-RPFG on a cycle of length n such that μ Q , η Q , and ν Q are constant functions, then its square q-RPFG S 2 ( G ) is edge regular.
Proof. 
Let G = ( P , Q ) be a q-RPFG defined on a cycle u 1 u 2 u 3 u n 1 u n u 1 (see Figure 19). Assume that μ Q , η Q , and ν Q are constant functions, and μ Q ( u i u i + 1 ) = c 1 , η Q ( u i u i + 1 ) = c 2 , and ν Q ( u i u i + 1 ) = c 3 for all i = 1 , 2 , , n , where n + 1 = 1 . The degree of edge u i u i + 1 can be computed as:
d G ( u i u i + 1 ) = d G ( u i ) + d G ( u i + 1 ) 2 ( μ Q ( u i u i + 1 ) , η Q ( u i u i + 1 ) , ν Q ( u i u i + 1 ) ) = ( μ Q ( u i 1 u i ) , η Q ( u i 1 u i ) , ν Q ( u i 1 u i ) ) + 2 ( μ Q ( u i u i + 1 ) , η Q ( u i u i + 1 ) , ν Q ( u i u i + 1 ) ) + ( μ Q ( u i + 1 u i + 2 ) , η Q ( u i + 1 u i + 2 ) , ν Q ( u i + 1 u i + 2 ) ) 2 ( μ Q ( u i u i + 1 ) , η Q ( u i u i + 1 ) , ν Q ( u i u i + 1 ) ) = ( μ Q ( u i 1 u i ) , η Q ( u i 1 u i ) , ν Q ( u i 1 u i ) ) + ( μ Q ( u i + 1 u i + 2 ) , η Q ( u i + 1 u i + 2 ) , ν Q ( u i + 1 u i + 2 ) ) = ( c 1 , c 2 , c 3 ) + ( c 1 , c 2 , c 3 ) = 2 ( c 1 , c 2 , c 3 ) .
Hence, G is edge regular. Let S 2 ( G ) be the square q-RPFG of G . To prove that S 2 ( G ) is edge regular, there arise three cases:
Case-I When n = 3 , we have a complete q-RPFG G . By Lemma 1, S 2 ( G ) is G itself.
Case-II When n = 4 , each pair of non-adjacent vertices is connected by two distinct paths of length 2. Thus, its square graph S 2 ( G ) will be a complete q-RPFG with μ Q , η Q , and ν Q are constant functions. In this case, S 2 ( G ) is edge regular by Theorem 8.
Case-III Let n 5 . Consider a vertex u in S 2 ( G ) . There are exactly two vertices which are at distance 2 from u . Therefore, u is adjacent to exactly two more vertices in S 2 ( G ) . Hence, S 2 ( G ) is 4-regular. Then, for each u v in S 2 ( G ) , we have
d S 2 ( G ) ( u v ) = d S 2 ( G ) ( u ) + d S 2 ( G ) ( v ) 2 ( μ Q s q ( u v ) , η Q s q ( u v ) , ν Q s q ( u v ) ) = 4 ( c 1 , c 2 , c 3 ) + 4 ( c 1 , c 2 , c 3 ) 2 ( c 1 , c 2 , c 3 ) = 6 ( c 1 , c 2 , c 3 ) .
Hence, S 2 ( G ) is 6 ( c 1 , c 2 , c 3 ) -edge regular. This completes the proof. □

2.3. Edge Regular q-RPF Line Graphs

Following [45], this section gives a brief discussion on edge regular q-rung picture fuzzy line graphs (q-RPFLGs). Akram and Habib [35] defined the q-RPFLGs as follows:
Definition 24. 
Let G = ( P , Q ) be a q-RPFG defined on G = ( P , Q ) . The q-rung picture fuzzy line graph L ( G ) = ( A , B ) with underlying graph L ( G ) = ( A , B ) where A = { S x = { x } { u x v x } | x Q , x = u x v x , u x , v x P } and B = { S x S y | S x S y ϕ , x , y Q , x y } can be defined as
(i)
For each vertex S x in A ,
μ A ( S x ) = μ Q ( x ) , η A ( S x ) = η Q ( x ) , ν A ( S x ) = ν Q ( x ) .
(ii)
For each edge S x S y in B ,
μ B ( S x S y ) = min { μ A ( S x ) , μ A ( S y ) } , η B ( S x S y ) = min { η A ( S x ) , η A ( S y ) } , ν B ( S x S y ) = max { ν A ( S x ) , ν A ( S y ) } .
Theorem 24. 
Let G = ( P , Q ) be a q-RPFG such that μ Q , η Q , and ν Q are constant functions. Then, d L ( G ) ( S x S y ) = ( c 1 , c 2 , c 3 ) [ d L ( G ) ( S x ) + d L ( G ) ( S y ) 2 ] for all S x S y B .
Proof. 
Let L ( G ) = ( A , B ) be a q-rung picture fuzzy line graph of a q-RPFG G = ( P , Q ) . For any S x S y B ,
d L ( G ) ( S x S y ) = d L ( G ) ( S x ) + d L ( G ) ( S y ) 2 ( μ B ( S x S y ) , η B ( S x S y ) , ν B ( S x S y ) ) = S x S z B ( μ Q ( S x S z ) , η Q ( S x S z ) , ν Q ( S x S z ) ) + S y S z B ( μ Q ( S y S z ) , η Q ( S y S z ) , ν Q ( S y S z ) ) 2 ( μ Q ( S x S y ) , η Q ( S x S y ) , ν Q ( S x S y ) ) = ( c 1 , c 2 , c 3 ) d L ( G ) ( S x ) + ( c 1 , c 2 , c 3 ) d L ( G ) ( S y ) 2 ( c 1 , c 2 , c 3 ) = ( c 1 , c 2 , c 3 ) [ d L ( G ) ( S x ) + d L ( G ) ( S y ) 2 ] .
This completes the proof. □
Remark 10. 
Consider a 6-RPFG G = ( P , Q ) as displayed in Figure 20a. Its corresponding line graph L ( G ) = ( A , B ) is displayed in Figure 20b.
We see that G is ( 1.8 , 1.8 , 1.4 ) -edge regular 6-RPFG. However, since d L ( G ) ( S x 1 S x 5 ) = ( 2.2 , 2.7 , 3.5 ) ( 1.8 , 2.2 , 2.4 ) = d L ( G ) ( S x 1 S x 2 ) ; therefore, L ( G ) is not an edge regular 6-RPFG.
We now develop a necessary condition for q-RPFLG to be perfect edge regular.
Theorem 25. 
Every q-rung picture fuzzy line graph L ( G ) = ( A , B ) of an edge regular q-RPFG G = ( P , Q ) is perfect edge regular only if μ Q , η Q , and ν Q are constant functions in G .
Proof. 
Let G = ( P , Q ) be an edge regular q-RPFG defined on G = ( P , Q ) . Then, for each edge u v in Q , d ( u v ) = ( p 1 , p 2 , p 3 ) . Let μ Q , η Q , and ν Q be constant functions. Then, for each edge u v in Q , μ Q ( u v ) = c 1 , η Q ( u v ) = c 2 and ν Q ( u v ) = c 3 . Consider L ( G ) = ( A , B ) as a q-RPFG as a q-rung picture fuzzy line graph of G . Then, by definition of q-rung picture fuzzy line graph, each vertex S x of L ( G ) corresponding to an edge u v = x of G has membership value ( μ A ( S x ) , η A ( S x ) , ν A ( S x ) ) = ( μ Q ( u v ) , η Q ( u v ) , ν Q ( u v ) ) = ( c 1 , c 2 , c 3 ) , and each edge of L ( G ) has membership value
( μ B ( S x S y ) , η B ( S x S y ) , ν B ( S x S y ) ) = ( μ A ( S x ) μ A ( S y ) , η A ( S x ) η A ( S y ) , η A ( S x ) η A ( S y ) ) = ( c 1 c 1 , c 2 c 2 , c 3 c 3 ) = ( c 1 , c 2 , c 3 ) .
Let u ( x ) and v ( x ) be the end points of an edge u v = x in G . Since G is edge regular with constant functions μ Q , η Q , and ν Q , therefore, each vertex u of G is common vertex of α (say) edges in G (see Figure 21).
Let S x be the vertex of L ( G ) corresponding to an edge x in G . The edge x has a vertex v x in common with α 1 edges v 1 , v 2 , , v α 1 . Similarly, u x is common with α 1 edges u 1 , u 2 , , u α 1 in G . Thus, each vertex S x in L ( G ) is common vertex of α 1 + α 1 = 2 α 2 edges. Hence, for all S x in L ( G )
d L ( G ) ( S x ) = 2 α 2 .
By Theorem 24, we have d L ( G ) ( S x S y ) = ( c 1 , c 2 , c 3 ) [ d L ( G ) ( S x ) + d L ( G ) ( S y ) 2 ] . Then, by Equation (1), d L ( G ) ( S x S y ) = ( c 1 , c 2 , c 3 ) [ 2 α 2 + 2 α 2 2 ] = 2 ( 2 α 3 ) ( c 1 , c 2 , c 3 ) , which implies that L ( G ) is an edge regular q-RPFG. Moreover, t d L ( G ) ( S x S y ) = d L ( G ) ( S x S y ) + ( μ B ( S x S y ) , η B ( S x S y ) , ν B ( S x S y ) ) = 2 ( 2 α 3 ) ( c 1 , c 2 , c 3 ) + ( c 1 , c 2 , c 3 ) = ( 4 α 5 ) ( c 1 , c 2 , c 3 ) , which shows that L ( G ) is total edge regular q-RPFG. Consequently, L ( G ) is perfect edge regular q-RPFG. This completes the proof. □
Remark 11. 
Consider a 4-RPFG G = ( P , Q ) as displayed in Figure 22a, and its line graph L ( G ) = ( A , B ) Figure 22b.
We see that L ( G ) is ( 0.7 , 0.8 , 1.4 ) -edge regular 4-RPFLG. However, since d G ( a b ) = ( 0.7 , 0.7 , 1.1 ) ( 1.2 , 0.8 , 1.2 ) = d G ( b c ) ; therefore, G is not an edge regular 4-RPFG.
Theorem 26. 
If L ( G ) = ( A , B ) is an edge regular q-rung picture fuzzy line graph of G = ( P , Q ) , and μ Q , η Q , and ν Q are constant functions, then G is edge regular q-RPFG.
Proof. 
The proof is similar to the proof of Theorem 25. □
Theorem 27. 
Let G = ( P , Q ) be a strong q-rung picture fuzzy graph such that μ P , η P , and ν P are constant functions. If G is an edge regular q-RPFG, then its line graph L ( G ) = ( A , B ) is an edge regular q-rung picture fuzzy graph.
Proof. 
Let G = ( P , Q ) be a strong edge regular q-rung picture fuzzy graph such that μ P , η P , and ν P are constant functions. Then, the functions μ Q , η Q , and ν Q must be constants. Consequently, the result follows from Theorem 25. □

3. Relations between Regular and Edge-Regular q-RPFGs

The fact that edge regularity property is a strong analog of regularity in fuzzy graphs is shown by many researchers. This section provides some additional properties relating regularity and edge regularity of q-RPFGs.
Remark 12. 
Every regular q-RPFG need not be edge regular.
For example, consider a 5-RPFG G = ( P , Q ) displayed in Figure 23.
It is clear that G is ( 1.75 , 1.72 , 2.2 ) -regular 5-RPFG, but G is not edge regular as d G ( a b ) = ( 2.0 , 2.2 , 3.0 ) ( 2.5 , 2.44 , 2.8 ) = d G ( b c ) .
Remark 13. 
Every edge regular q-RPFG need not be regular.
For example, consider a 6-RPFG G as shown in Figure 10. It is clear that G is ( 1.4 , 1.8 , 1.6 ) -edge regular 6-RPFG but G is not regular as d G ( u ) = ( 0.8 , 1.0 , 0.6 ) ( 1.4 , 1.8 , 1.6 ) = d G ( v ) .
The above remarks show that one form of regularity can not imply another form. We now develop some results between regularity and edge regularity.
Theorem 28. 
Let G = ( P , Q ) be a regular q-RPFG on G = ( P , Q ) . Then, G is edge regular if and only if μ Q , η Q , and ν Q are constant functions.
Proof. 
Let G = ( P , Q ) be a ( k 1 , k 2 , k 3 ) -regular q-RPFG. Then, d G ( u ) = ( k 1 , k 2 , k 3 ) for all u P . Assume that μ Q , η Q , and ν Q are constant functions, that is, μ Q ( u v ) = c 1 , η Q ( u v ) = c 2 , and ν Q ( u v ) = c 3 . By definition of edge degree d G ( u v ) = d G ( u ) + d G ( v ) 2 ( μ Q ( u v ) , η Q ( u v ) , ν Q ( u v ) ) = 2 ( k 1 , k 2 , k 3 ) 2 ( c 1 , c 2 , c 3 ) = 2 ( p 1 c 1 , p 2 c 2 , p 3 c 3 ) for all u v Q . Hence, G is edge regular.
Conversely, assume that G is ( p 1 , p 2 , p 3 ) -edge regular. Then, d G ( u v ) = ( p 1 , p 2 , p 3 ) , for all u v Q . By definition of edge degree ( p 1 , p 2 , p 3 ) = 2 ( k 1 , k 2 , k 3 ) 2 ( μ Q ( u v ) , η Q ( u v ) , ν Q ( u v ) ) . Thus, ( μ Q ( u v ) , η Q ( u v ) , ν Q ( u v ) ) = ( 2 k 1 p 1 , 2 k 2 p 2 , 2 k 3 p 3 ) 2 , for all u v Q . Hence, μ Q , η Q , and ν Q are constant functions. This completes the proof. □
Theorem 29. 
Let G = ( P , Q ) be a q-RPFG on G = ( P , Q ) such that μ Q , η Q , and ν Q are constant functions. If G is full regular q-RPFG, then G is full edge regular q-RPFG.
Proof. 
Let G = ( P , Q ) be a q-RPFG on G = ( P , Q ) , and μ Q ( u v ) = c 1 , η Q ( u v ) = c 2 , and ν Q ( u v ) = c 3 , for all u v Q . Assume that G is full regular q-RPFG, that is, d G ( u ) = ( k 1 , k 2 , k 3 ) , and d G ( u ) = k for all u P . Then, d G ( u v ) = d G ( u ) + d G ( v ) 2 = 2 r 2 . Hence, G is edge regular graph. Now, d G ( u v ) = d G ( u ) + d G ( v ) 2 ( μ Q ( u v ) , η Q ( u v ) , ν Q ( u v ) ) = 2 ( k 1 , k 2 , k 3 ) 2 ( c 1 , c 2 , c 3 ) = 2 ( k 1 c 1 , k 2 c 2 , k 3 c 3 ) . Hence, G is edge regular q-RPFG. Consequently, G is full edge regular q-RPFG. □
Remark 14. 
The converse of the above theorem need not be true.
For example, consider a 4-RPFG G as displayed in Figure 24.
We see that G is ( 0.5 , 0.2 , 0.6 ) -edge regular q-RPFG, and G is 1-edge regular graph. Thus, G is full edge regular q-RPFG. However, since d G ( a ) = ( 0.5 , 0.2 , 0.6 ) ( 1.0 , 0.4 , 1.2 ) = d G ( c ) , therefore, G is not regular. Moreover, G is not regular. Thus, G is not full regular.
Theorem 30. 
Let μ Q , η Q , and ν Q are constant functions in a q-RPFG G = ( P , Q ) . If G is regular, then G is perfect edge regular.
Proof. 
Let G = ( P , Q ) be a q-RPFG on G = ( P , Q ) with μ Q ( u v ) = c 1 , η Q ( u v ) = c 2 , and ν Q ( u v ) = c 3 , for all u v Q . Assume that G is ( k 1 , k 2 , k 3 ) -regular. Then, d G ( u ) = ( k 1 , k 2 , k 3 ) , for all u P . By definition of edge degree, d G ( u v ) = d G ( u ) + d G ( u ) 2 ( μ Q ( u v ) , η Q ( u v ) , ν Q ( u v ) ) = 2 ( k 1 c 1 , k 2 c 2 , k 3 c 3 ) , for all u v Q . Moreover, by definition of total edge degree, t d G ( u v ) = d G ( u ) + d G ( u ) ( μ Q ( u v ) , η Q ( u v ) , ν Q ( u v ) ) = ( 2 k 1 c 1 , 2 k 2 c 2 , 2 k 3 c 3 ) , for all u v Q . Hence, G is perfect edge regular. □
Remark 15. 
The converse of above theorem need not be true.
For example, consider 11-RPFG G as shown in Figure 25.
We see that G is ( 0.9 , 0.9 , 0.9 ) -edge regular, and ( 1.2 , 1.2 , 1.2 ) -total edge regular 11-RPFG, but G is not regular 11-RPFG as d G ( a ) = ( 0.6 , 0.6 , 0.6 ) ( 0.9 , 0.9 , 0.9 ) = d G ( b ) .
Theorem 31. 
[35] Let G = ( P , Q ) be a q-RPFG such that μ Q , η Q , and ν Q are constant functions. Then, G is regular q-RPFG if and only if G is partially regular q-RPFG.
Theorem 32. 
If a q-RPFG G = ( P , Q ) is perfect edge regular, then G is regular if and only if G is partially regular.
Proof. 
Let G = ( P , Q ) be perfect edge regular. Then, by Theorem 15, μ Q , η Q , and ν Q are constant functions. Thus, Theorem 31 implies that G is regular if and only if G is partially regular. □
Remark 16. 
The converse of above theorem need not be true.
For example, consider a 5-RPFG G as shown in Figure 26.
We see that G is ( 1.0 , 1.0 , 1.3 ) -regular 5-RPFG. Moreover, G is partially regular. However, it is easy to observe that G is neither edge regular nor total edge regular.
Theorem 33. 
Let G = ( P , Q ) be the k-partially regular q-RPFG. Then, μ Q , η Q , and ν Q are constant functions if and only if G both regular, and perfect edge regular.
Proof. 
Consider a q-RPFG G = ( P , Q ) defined on G = ( P , Q ) such that G is k-regular. Assume that μ Q ( u v ) = c 1 , η Q ( u v ) = c 2 , and ν Q ( u v ) = c 3 , for all u v Q . Then, d G ( u ) = u v Q ( μ Q ( u v ) , η Q ( u v ) , ν Q ( u v ) ) = u v Q ( c 1 , c 2 , c 3 ) = ( c 1 , c 2 , c 3 ) d G ( u ) = k ( c 1 , c 2 , c 3 ) for all u P . Hence, G is regular q-RPFG. Thus, by Theorem 30, G is perfect edge regular.
Conversely, let G be both regular, and perfect edge regular. Then, suppose that d G ( u ) = ( k 1 , k 2 , k 3 ) for all u P , d G ( u v ) = ( p 1 , p 2 , p 3 ) , and t d G ( u v ) = ( q 1 , q 2 , q 3 ) for all u v Q . By definition of edge degree,
d G ( u v ) = d G ( u ) + d G ( u ) 2 ( μ Q ( u v ) , η Q ( u v ) , ν Q ( u v ) ) , ( p 1 , p 2 , p 3 ) = 2 ( k 1 , k 2 , k 3 ) 2 ( μ Q ( u v ) , η Q ( u v ) , ν Q ( u v ) ) , ( μ Q ( u v ) , η Q ( u v ) , ν Q ( u v ) ) = ( 2 k 1 p 1 , 2 k 2 p 2 , 2 k 3 p 3 ) 2 .
Hence, μ Q , η Q , and ν Q are constant functions. This completes the proof. □
Lemma 3. 
If G = ( P , Q ) is perfectly regular (or regular) q-RPFG, and μ Q , η Q , and ν Q are constant functions, then G is perfect edge-regular.
Proof. 
Let G = ( P , Q ) be a perfectly regular q-RPFG defined on G = ( V , E ) , and μ Q , η Q , and ν Q be constant functions. Then, ( μ Q ( u v ) , η Q ( u v ) , ν Q ( u v ) ) = ( c 1 , c 2 , c 3 ) for all u v Q . Since G is regular q-RPFG, therefore, d G ( u ) = ( k 1 , k 2 , k 3 ) for all u V . Then, for any edge u v in G , d G ( u v ) = d G ( u ) + d G ( v ) 2 ( μ Q ( u v ) , η Q ( u v ) , ν Q ( u v ) ) = 2 ( k 1 , k 2 , k 3 ) 2 ( c 1 , c 2 , c 3 ) = 2 ( k 1 c 1 , k 2 c 2 , k 3 c 3 ) . Hence, G is edge regular q-RPFG. Now, the total degree of an edge in q-RPFG is t d G ( u v ) = d G ( u v ) + ( μ Q ( u v ) , η Q ( u v ) , ν Q ( u v ) ) = 2 ( k 1 c 1 , k 2 c 2 , k 3 c 3 ) + ( c 1 , c 2 , c 3 ) = ( 2 k 1 c 1 , 2 k 2 c 2 , 2 k 3 c 3 ) for all u v Q . Thus, G is total edge-regular q-RPFG. Consequently, G is perfect edge-regular q-RPFG. This completes the proof. □
Remark 17. 
If G = ( P , Q ) is totally regular q-RPFG, and μ Q , η Q , and ν Q are constant functions, then G may not perfect edge-regular.
For example, consider a 3-RPFG G as shown in Figure 27.
We see that G is totally regular since t d G ( a ) = t d G ( b ) = t d G ( c ) = t d G ( d ) = ( 1.6 , 1.2 , 0.8 ) , and μ Q ( u v ) , η Q ( u v ) , and ν Q ( u v ) are constant functions as μ Q ( u v ) = 0.4 , η Q ( u v ) = 0.3 , and ν Q ( u v ) = 0.2 for all u v Q . However, d G ( a b ) = ( 1.2 , 0.9 , 0.6 ) ( 1.6 , 1.2 , 0.8 ) = d G ( a c ) leads G to be not edge-regular 3-RPFG. Thus, G is not perfect edge-regular.
Theorem 34. 
If G = ( P , Q ) is complete perfectly regular q-RPFG, then G is perfect edge-regular.
Proof. 
Let G = ( P , Q ) be a complete perfectly regular q-RPFG defined on G = ( P , Q ) . Then, for each vertex u of G , ( μ P ( u ) , η P ( u ) , ν P ( u ) ) = ( k 1 , k 2 , k 3 ) . In addition, completeness of G implies that, for every edge u v of G , ( μ Q ( u v ) , η Q ( u v ) , ν Q ( u v ) ) = ( μ P ( u ) μ P ( v ) , η P ( u ) η P ( v ) , ν P ( u ) ν P ( v ) ) . Combining the two facts above, we obtain ( μ Q ( u v ) , η Q ( u v ) , ν Q ( u v ) ) = ( k 1 , k 2 , k 3 ) for all u v Q . It shows that μ Q , η Q , and ν Q are constant functions. Hence, by Lemma 3, G is perfect edge-regular q-RPFG. This completes the proof. □
Next, we relate the concepts of regularity and edge regularity in q-RPF line graphs.
Observation 1. 
The total degree of an edge x in G is equal to the sum of the membership values of corresponding vertex S x , and its adjacent vertices in L ( G ) .
Theorem 35. 
Let G = ( P , Q ) be a q-RPFG such that μ Q , η Q , and ν Q are constant functions. If G is a regular q-RPFG, then its line graph L ( G ) = ( A , B ) is an edge regular q-RPFG.
Proof. 
Let G = ( P , Q ) be a regular q-RPFG such that μ Q , η Q , and ν Q are constant functions. Then, by Theorem 28, G is an edge regular q-RPFG. Consequently, by Theorem 25, the q-RPF line graph L ( G ) = ( A , B ) is edge regular. □
Remark 18. 
The converse of the above theorem need not be true.
Consider a 4-rung picture fuzzy graph G = ( P , Q ) , and its line graph L ( G ) = ( A , B ) as shown in Figure 28.
We see that μ Q , η Q , and ν Q are constant functions, that is, for each u v in Q , ( μ Q ( u v ) , η Q ( u v ) , ν Q ( u v ) ) = ( 0.4 , 0.5 , 0.7 ) . Since each edge of L ( G ) has degree ( 1.6 , 2.0 , 2.8 ) , therefore, L ( G ) is ( 1.6 , 2.0 , 2.8 ) -edge regular 4-rung picture fuzzy line graph of G . However, d G ( b ) = ( 0.8 , 1.0 , 1.4 ) ( 1.2 , 1.5 , 2.1 ) = d G ( a ) leads to the fact that the 4-RPFG G is not regular.

4. Applications

Graph theory, graph-partitioning, and graph-based computing are characterized by detecting different network structures. The unstoppable growth of social networks, and the huge number of connected users, has made these networks some of the most popular, and successful domains for a large number of research areas. The different possibilities, volume, and variety that these social networks offer has made them essential tools for everyday working, and social relationships. The number of users registered in different social networks, and the volume of information generated by them in a more explanatory manner are increasing day by day. The analysis over the whole network becomes extremely difficult due to this fact. For instance, if every people has 5 close friends, then in a town of 10,000 people, there will be 50,000 close friendship ties to study. In order to extract the knowledge from such a large network, some relevant works have focused the attention on ‘ego-networks’. On the other hand, if someone does not want to understand a whole community, but just what individual people do, that is, one only finds some people in a community interesting (leaders, teenagers, artists, etc.), also lead to study ego-networks, which tells us about social structure of entire population, and its sub-populations.
An Ego-network is a social network composed of one user centering the graph (called ego), all the users connected to this ego (called alters), and all the relations between these alters (called ties). Ego can be considered as an individual ‘focal’ node. It can be a person, a group, an organization, or a whole society. A network has as many egos as it has nodes.

q-Rung Picture Fuzzy Social Network

An ordinary social network cannot represent the power of employees, and the degree of relations among employees within an organization. As the powers, and relationships have no defined boundaries, it is desired to represent them in the form of fuzzy set. The fuzzy social networks are used to express interactions between different nodes. It is obvious that the fuzzy graph model is not enough to fully illustrate any phenomenon represented by networks/graphs. Several extensions of fuzzy set have been introduced in this context. Thus, to deal with the situations where opinions are not only yes or no, but there are some abstinence, and refusal too; recently, the q-rung picture fuzzy graph model was introduced, providing a vast depiction space of triplets. We now discuss the concept of ego-networks under q-rung picture fuzzy environment.
Algorithm 1 illustrates the extraction of q-rung picture fuzzy ego-networks from a q-rung picture fuzzy social network G = ( P , Q ) . The complexity of algorithm is O ( n 2 ) , where n = | P | .
Algorithm 1 Extraction of q-rung picture fuzzy ego-networks
INPUT: A q-RPF social network G = ( P , Q ) .
OUTPUT: A q-RPF ego-network G i = ( P i , Q i ) .
  • function G i = ( P i , Q i )
  • for i = 1 t o n do
  •     for j = 1 t o n do
  •         if u i ( μ P ( u i ) , η P ( u i ) , ν P ( u i ) ) is q-RPF ego then
  •            choose all u j ( μ P ( u j ) , η P ( u j ) , ν P ( u j ) ) such that i j and
  • ( μ Q ( u i u j ) , η Q ( u i u j ) , ν Q ( u i u j ) ) ( 0 , 0 , 0 )
  • Define a q-RPF vertex set
  • P i = { u i ( μ P ( u i ) , η P ( u i ) , ν P ( u i ) ) , u j ( μ P ( u j ) , η P ( u j ) , ν P ( u j ) ) | f o r a l l j }
  • and a q-RPF edge set
  • Q i = { u i u j ( μ Q ( u i u j ) , η Q ( u i u j ) , ν Q ( u i u j ) ) , u j u j ( μ Q ( u j u j ) , η Q ( u j u j ) , ν Q ( u j u j ) ) | j < j , f o r a l l j }
  •         end if
  •     end for
  • end for
  • end function
We can use q-RPFG to examine the social relationships among different groups of people. By the concept of q-RPF ego-networks, we can focus on a single entity to investigate its potential with other members of a social group. We can also examine the percentage of relationships under a q-rung picture fuzzy environment.
Consider a large company in Japan. The typical structure of executive titles is illustrated as a set of employees P = {Chairman (C), CEO, President (C), Deputy president (DP)/Senior executive (SE), Executive vice president (EVP), Senior vice president (SVP), Vice president (VP)/general manager (GM)/Department head (DH), Deputy general manager (DGM), Manager (M)/Section head (SH), Assistant manager (AM)/Team leader (TL), Staff (S)} for that company. Let P be the 4-RPFS on P given by Table 1.
Figure 29 displays a 4-RPFG representing the social network composed of 11 different employees.
There are 11 different q-RPF ego networks/graphs associated with the given q-RPF network/graph, where the vertices/nodes represent the powers of employees in the company, and edges/links represent their relationships. The membership functions μ P , η P , and ν P in triplet ( μ P , η P , ν P ) , assigned to each node, indicate their positive impact, their neutral behavior, and their negative impact within the company, respectively. For example, ( 0.8 , 0.5 , 0.7 ) tells the status level of the CEO as: the CEO possesses 40.96 % positive impact, and 24.01 % negative impact within the company. A total of 6.25 % of his behavior is neutral. While the refusal degree π = 1 0.8 4 0.5 4 0.7 4 4 of CEO indicates that only 28.78000001 % , he has the ability to refuse to participate in the company’s matters. However, the positive, neutral, and negative membership degrees μ Q , η Q , and ν Q of edges depict the positive associations, abstinence to associate, and negative associations among employees. For example, the edge between president and assistant manager is assigned by triplet ( 0.3 , 0.5 , 0.3 ) . The relationships between them can be translated by a means of q-rung picture fuzzy analysis as follows: they have only 0.81 % positive attitude. The neutral and negative behavior have same the weight, i.e., 6.25 % and 86.69 % of interactions translate the extent of the clash between them. Similar considerations can be extracted from other edges. The corresponding adjacency matrix is shown in Table 2, where the degrees for each edge u v in G = ( P , Q ) are evaluated using the following relations:
μ Q ( u v ) μ P ( u ) μ P ( v ) , η Q ( u v ) η P ( u ) η P ( v ) , ν Q ( u v ) ν P ( u ) ν P ( v ) .
The CEO is a company’s top decision-maker, and all other executives answer to him/her. Next, we want to study the powers of the CEO in this company, and his associations with other executives. For this, we consider the CEO as ego, and extract a q-rung picture fuzzy ego network from a q-rung picture fuzzy social network (see Figure 29) according to Algorithm 1.
Figure 30 displays a q-rung picture fuzzy ego network H = ( A , B ) for selected ego, i.e., CEO (colored node).
The CEO influences the executives who are board members, and jointly supervise the activities of company. The titles designate an individual as an officer of the company with specific responsibilities that make them legally accountable in their position. The following investigations provide a q-RPF social network analysis for the CEO:
  • The impact of CEO is equally distributed with the vice president, and deputy president as the positive, neutral, and negative associations of both are 6.25 % , 6.25 % , and 24.01 % , respectively.
  • The CEO greatly refuses to value the inputs of executive vice present for strategic initiatives as there is 91.19 % refusal part while no negative associations between them, where the positive associations are 6.25 % , and 2.56 % is the neutrality in their behavior.
  • By means of the positive and negative associations of the CEO with the Chairman, the founder of the company, we can this interpret as: the Chairman works 40.96 % on the CEO’s opinion, for 0.81 % , he works opposite of his opinion, for 0.16 % , his behavior is neutral with the CEO, and, for 58.07 % , the chairman refuses to trust his part.
  • The reporting relationships between general manager, and CEO is 12.96 % positive, 2.56 % neutral, and 40.96 % negative, while, for 56.48 % of his own part, the general manager refuses to report to him.
  • Between the vice president and deputy president, there is less positive ( 0.16 % ) , and high negative ( 24.01 % ) associations, which indicate their history of conflict.
  • The manager being a section head has to resolve all cases in his section to answer to the CEO. The absence of edge with the executive vice president show that he has no concern with the executive vice president in company’s matters.
The similar investigations can be seen between executives (alters) in the q-RPF ego-network (Figure 30).

5. Conclusions

Real life situations are often very uncertain and vague in nature. Due to a lack of information, the future state of system might not be completely known. The notion of fuzzy set offers a suitable departure point for the creation of such a framework which has potentially wider scope of applicability. The picture and spherical fuzzy models are a good way to tackle the uncertain information, when people think about not only the reaction is positive or negative, but there are some abstinence and refusal. The q-RPF model is more efficient than picture and spherical fuzzy models because it provides a wide space of permissible triplets. In the present study, we have explored some graph-theoretic ideas under q-RPF circumstances. Regularity is one of the attributes that permits many of the challenges connected with graph analysis to be addressed. The present study has provided a novel description on edge regularity of q-RPFGs and developed several related results. In particular, the edge regularity of square q-RPFGs and q-RPF line graphs has been illustrated. These graphs have eventually helped to link certain q-RPF systems and crisp systems allowing for greater ease in computing properties of these q-RPF systems for modeling purposes or optimizing q-RPF networks. Moreover, the q-RPFLGs can be applied to work out extremal problems. We have also established the relationships between regular and edge regular q-RPFGs. Finally, we have presented the concept of q-RPF ego-networks to extract knowledge from large social networks as an application. Our future work will expand on these terms: (1) Interval-valued q-RPFGs; (2) Bipolar-valued q-RPFGs; and (3) Hesitant q-RPFGs.

Author Contributions

M.A., A.H. and A.N.A.K. conceived of the presented concept. M.A. and A.H. developed the theory and performed the computations. A.N.A.K. verified the analytical methods.

Funding

This research received no external funding.

Conflicts of Interest

The authors declare that they have no conflict of interest regarding the publication of the research article.

References

  1. Zadeh, L.A. Fuzzy sets. Inf. Control 1965, 8, 338–353. [Google Scholar] [CrossRef]
  2. Cuong, B.C. Picture fuzzy sets—First results, Part 1. In Seminar Neuro-Fuzzy Systems with Applications; Preprint 03/2013; Institute of Mathematics, Vietnam Academy of Science and Technology: Hanoi, Vietnam, 2013. [Google Scholar]
  3. Cuong, B.C. Picture fuzzy sets—First results, Part 2. In Seminar Neuro-Fuzzy Systems with Applications; Preprint 04/2013; Institute of Mathematics, Vietnam Academy of Science and Technology: Hanoi, Vietnam, 2013. [Google Scholar]
  4. Atanassov, K. Intuitionistic fuzzy sets: Theory and Applications. Fuzzy Sets Syst. 1986, 20, 87–96. [Google Scholar] [CrossRef]
  5. Son, L.H. DPFCM: A novel distributed picture fuzzy clustering method on picture fuzzy sets. Exp. Syst. Appl. 2015, 2, 51–66. [Google Scholar] [CrossRef]
  6. Thong, N.T. HIFCF: An effective hybrid model between picture fuzzy clustering and intuitionistic fuzzy recommender systems for medical diagnosis. Exp. Syst. Appl. 2015, 42, 3682–3701. [Google Scholar] [CrossRef]
  7. Cuong, B.C.; Kreinovich, V. Picture fuzzy sets—A new concept for computational intelligence problems. In Proceedings of the 3rd World Congress on Information and Communication Technologies (WICT 2013), Hanoi, Vietnam, 15–18 December 2013; ISBN 918-1-4799-3230-6. [Google Scholar]
  8. Cuong, B.C. Picture fuzzy sets. J. Comput. Sci. Cybern. 2014, 30, 409–420. [Google Scholar]
  9. Cuong, B.C.; Hai, P.V. Some fuzzy logic operators for picture fuzzy sets. In Proceedings of the Seventh International Conference on Knowledge and Systems Engineering, Ho Chi Minh City, Vietnam, 8–10 October 2015. [Google Scholar]
  10. Garg, H. Some picture fuzzy aggregation operators and their applications to multicriteria decision-making. Arab. J. Sci. Eng. 2017, 42, 5275–5290. [Google Scholar] [CrossRef]
  11. Son, L.H.; Viet, P.V.; Hai, P.V. Picture inference system: A new fuzzy inference system on picture fuzzy set. Appl. Intell. 2017, 46, 652–669. [Google Scholar] [CrossRef]
  12. Wang, C.Y.; Zhou, X.Q.; Tu, H.N.; Tao, S.D. Some geometric aggregation operators based on picture fuzzy sets and their application in multiple attribute decision making. Ital. J. Pure Appl. Math. 2017, 37, 477–492. [Google Scholar]
  13. Zhang, H.; Zhang, R.; Huang, H.; Wang, J. Some picture fuzzy Dombi Heronian mean operators with their application to multi-attribute decision-making. Symmetry 2018, 10, 593. [Google Scholar] [CrossRef]
  14. Yager, R.R.; Abbasov, A.M. Pythagorean membership grades, complex numbers, and decision making. Int. J. Intell. Syst. 2013, 28, 436–452. [Google Scholar] [CrossRef]
  15. Yager, R.R. Generalized orthopair fuzzy sets. IEEE Trans. Fuzzy Syst. 2017, 25, 1222–1230. [Google Scholar] [CrossRef]
  16. Gündoğdu, F.K.; Kahraman, C. Spherical fuzzy sets and spherical fuzzy TOPSIS method. J. Intell. Fuzzy Syst. 2018. [Google Scholar] [CrossRef]
  17. Li, L.; Zhang, R.; Wang, J.; Shang, X.; Bai, K. A novel approach to muti-attribut group decision-making with q-rung rung picture linguistic information. Symmetry 2018, 10, 172. [Google Scholar] [CrossRef]
  18. Ashraf, S.; Abdulla, S.; Mahmood, T.; Ghani, F.; Mahmood, T. Spherical fuzzy sets and their applications in multi-attribute decision making problems. J. Intell. Fuzzy Syst. 2018. [Google Scholar] [CrossRef]
  19. Liu, P.; Wang, P. Some q-rung orthopair fuzzy aggregation operators and their applications to multiple-attribute decision making. Int. J. Intell. Syst. 2017, 33, 259–280. [Google Scholar] [CrossRef]
  20. Mahmood, T.; Ullah, K.; Khan, Q.; Jan, N. An approach toward decision-making and medical diagnosis problems using the concept of spherical fuzzy sets. J. Neutral Comput. Appl. 2018. [Google Scholar] [CrossRef]
  21. Xu, Y.; Shang, X.; Wang, J.; Wu, W.; Huang, H. Some q-rung dual hesitant fuzzy Heronian mean operators with their application to multiple attribute group decision-making. Symmetry 2018, 10, 472. [Google Scholar] [CrossRef]
  22. Zadeh, L.A. Similarity relations and fuzzy ordering. Inf. Sci. 1971, 3, 177–200. [Google Scholar] [CrossRef]
  23. Kaufmann, A. Introduction a la Theorie des Sousensembles Flous; Massonet Cie Paris: Paris, France, 1973. [Google Scholar]
  24. Rosenfeld, A. Fuzzy graphs. In Fuzzy Sets and Their Applications to Cognitive and Decision Processes; Academic Press: New York, NY, USA, 1975; pp. 77–95. [Google Scholar]
  25. Karunambigai, M.G.; Parvathi, R. Intuitionistic fuzzy graphs. In Advances in Soft Computing: Computational Intelligence, Theory and Applications, Proceedings of the 9th Fuzzy Days International Conference on Computational Intelligence; Springer: Berlin/Heidelberg, Germany, 2006; Volume 20, pp. 139–150. [Google Scholar]
  26. Akram, M.; Davvaz, B. Strong intuitionistic fuzzy graphs. Filomat 2012, 26, 177–196. [Google Scholar] [CrossRef]
  27. Naz, S.; Ashraf, S.; Akram, M. A novel approach to decision-making with Pythagorean fuzzy information. Mathematics 2018, 6, 95. [Google Scholar] [CrossRef]
  28. Habib, A.; Akram, M.; Farooq, A. q-Rung orthopair fuzzy competition graphs with application in soil ecosystem. Mathematics 2019, 7, 91. [Google Scholar] [CrossRef]
  29. Akram, M. m-Polar Fuzzy Graphs: Theory, Methods and Applications; Studies in Fuzziness and Soft Computing; Springer: Cham, Switzerland, 2019; Volume 371, pp. 1–284. [Google Scholar]
  30. Akram, M.; Ashraf, A.; Sarwar, M. Novel applications of intuitionistic fuzzy digraphs in decision support systems. Sci. World J. 2014, 2014, 904606. [Google Scholar] [CrossRef] [PubMed]
  31. Akram, M.; Naz, S. Energy of Pythagorean fuzzy graphs with applications. Mathematics 2018, 6, 136. [Google Scholar] [CrossRef]
  32. Akram, M.; Habib, A.; Ilyas, F.; Dar, J.M. Specific types of Pythagorean fuzzy graphs and application to decision-making. Math. Comput. Appl. 2018, 23, 42. [Google Scholar] [CrossRef]
  33. Akram, M.; Dar, J.M.; Farooq, A. Planar graphs under Pythagorean fuzzy environment. Mathematics 2018, 6, 278. [Google Scholar] [CrossRef]
  34. Sokolov, S.; Zhilenkov, A.; Chernyi, S.; Nyrkov, A.; Mamunts, D. Dynamics models of synchronized piecewise linear discrete chaotic systems of high order. Symmetry 2019, 11, 236. [Google Scholar] [CrossRef]
  35. Akram, M.; Habib, A. q-Rung picture fuzzy graphs: A creative view on regularity with applications. J. Appl. Math. Comput. 2019. [Google Scholar] [CrossRef]
  36. Gani, A.N.; Ahamed, M.B. Order and size in fuzzy graphs. Bull. Pure Appl. Sci. 2003, 22, 145–148. [Google Scholar]
  37. Radha, K.; Kumaravel, N. On Edge regular fuzzy graphs. Int. J. Math. Arch. 2004, 5, 100–112. [Google Scholar]
  38. Cary, M. Perfectly regular and perfect edge regular fuzzy graphs. Ann. Pure Appl. Math. 2018, 16, 461–469. [Google Scholar]
  39. Akram, M.; Dudek, W.A.; Yousaf, M.M. Regularity in vague intersection graphs and vague line graphs. In Abstract and Applied Analysis; Hindawi: Cairo, Egypt, 2014. [Google Scholar]
  40. Akram, M.; Dudek, W.A. Regular bipolar fuzzy graphs. Neutral Comput. Appl. 2012, 21, 197–205. [Google Scholar] [CrossRef]
  41. Ashraf, S.; Naz, S.; Rashmanlou, H.; Malik, M.A. Regularity of graphs in single valued neutrosophic environemnt. J. Intell. Fuzzy Syst. 2017. [Google Scholar] [CrossRef]
  42. Gani, A.N.; Radha, K. Regular property of fuzzy graphs. Bull. Pure Appl. Sci. 2008, 27, 415–423. [Google Scholar]
  43. Gani, A.N.; Radha, K. On regular fuzzy graphs. J. Phys. Sci. 2008, 12, 33–40. [Google Scholar]
  44. Karunambigai, M.G.; Palanivel, K.; Sivasankar, S. Edge regular intuitionistic fuzzy graph. Adv. Fuzzy Sets Syst. 2015, 20, 25–46. [Google Scholar] [CrossRef]
  45. Radha, K.; Kumaravel, N. On Edge regular fuzzy line graphs. Int. J. Comput. Appl. Math. 2016, 11, 105–118. [Google Scholar]
  46. Radha, K.; Kumaravel, N. The degree of an edge in cartesian product and composition of two fuzzy graphs. Int. J. Appl. Math. Stat. Sci. 2013, 2, 65–78. [Google Scholar]
  47. Sanjeevi, G. Some results on square fuzzy graphs. Int. J. Math. Arch. 2017, 8, 124–128. [Google Scholar]
Figure 1. Comparison of Spaces of q-RPFS.
Figure 1. Comparison of Spaces of q-RPFS.
Symmetry 11 00489 g001
Figure 2. A 4-RPFG G .
Figure 2. A 4-RPFG G .
Symmetry 11 00489 g002
Figure 3. A regular 3-RPFG G .
Figure 3. A regular 3-RPFG G .
Symmetry 11 00489 g003
Figure 4. A totally regular 2-RPFG G .
Figure 4. A totally regular 2-RPFG G .
Symmetry 11 00489 g004
Figure 5. Perfectly Regular 3-RPFG.
Figure 5. Perfectly Regular 3-RPFG.
Symmetry 11 00489 g005
Figure 6. A 4-RPFG G .
Figure 6. A 4-RPFG G .
Symmetry 11 00489 g006
Figure 7. An edge regular 3-RPFG G .
Figure 7. An edge regular 3-RPFG G .
Symmetry 11 00489 g007
Figure 8. A total edge regular 3-RPFG G .
Figure 8. A total edge regular 3-RPFG G .
Symmetry 11 00489 g008
Figure 9. 4-RPFG G .
Figure 9. 4-RPFG G .
Symmetry 11 00489 g009
Figure 10. 6-RPFG G .
Figure 10. 6-RPFG G .
Symmetry 11 00489 g010
Figure 11. A partially edge regular 5-RPFG G .
Figure 11. A partially edge regular 5-RPFG G .
Symmetry 11 00489 g011
Figure 12. An edge regular but not partially edge regular 6-RPFG G .
Figure 12. An edge regular but not partially edge regular 6-RPFG G .
Symmetry 11 00489 g012
Figure 13. Perfectly edge regular 5-RPFG.
Figure 13. Perfectly edge regular 5-RPFG.
Symmetry 11 00489 g013
Figure 14. A 4-RPFG G .
Figure 14. A 4-RPFG G .
Symmetry 11 00489 g014
Figure 15. A 6-RPFG G and its square graph S 2 ( G ) .
Figure 15. A 6-RPFG G and its square graph S 2 ( G ) .
Symmetry 11 00489 g015
Figure 16. A 3-RPFG G and its square graph S 2 ( G ) .
Figure 16. A 3-RPFG G and its square graph S 2 ( G ) .
Symmetry 11 00489 g016
Figure 17. A 5-RPFG G and its square graph S 2 ( G ) .
Figure 17. A 5-RPFG G and its square graph S 2 ( G ) .
Symmetry 11 00489 g017
Figure 18. Role of a vertex u 1 in square graph of a complete bipartite graph.
Figure 18. Role of a vertex u 1 in square graph of a complete bipartite graph.
Symmetry 11 00489 g018
Figure 19. Square graph S 2 ( C n ) of cycle C n .
Figure 19. Square graph S 2 ( C n ) of cycle C n .
Symmetry 11 00489 g019
Figure 20. A 6-RPFLG of G .
Figure 20. A 6-RPFLG of G .
Symmetry 11 00489 g020
Figure 21. View of a graph towards its line graph.
Figure 21. View of a graph towards its line graph.
Symmetry 11 00489 g021
Figure 22. A 4-RPFLG of G
Figure 22. A 4-RPFLG of G
Symmetry 11 00489 g022
Figure 23. A regular but not edge regular 5-RPFG G .
Figure 23. A regular but not edge regular 5-RPFG G .
Symmetry 11 00489 g023
Figure 24. A 4-RPFG G .
Figure 24. A 4-RPFG G .
Symmetry 11 00489 g024