Next Article in Journal
Data-Proximal Complementary 1-TV Reconstruction for Limited Data Computed Tomography
Previous Article in Journal
A Developed Model and Fuzzy Multi-Criteria Decision-Making Method to Evaluate Supply Chain Nervousness Strategies
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A Study on Optimizing the Maximal Product in Cubic Fuzzy Graphs for Multifaceted Applications

1
Department of Mathematics, Vel Tech Rangarajan Dr. Sagunthala R&D Institute of Science and Technology, Avadi, Chennai 600062, India
2
Department of Machining, Assembly and Engineering Metrology, Faculty of Mechanical Engineering, VSB-Technical University of Ostrava, 70800 Ostrava, Czech Republic
3
Department of Mechanical Engineering, Vel Tech Rangarajan Dr. Sagunthala R&D Institute of Science and Technology, Avadi, Chennai 600062, India
*
Authors to whom correspondence should be addressed.
Mathematics 2024, 12(10), 1605; https://doi.org/10.3390/math12101605
Submission received: 5 April 2024 / Revised: 9 May 2024 / Accepted: 16 May 2024 / Published: 20 May 2024

Abstract

:
Graphs in the field of science and technology make considerable use of theoretical concepts. When dealing with numerous links and circumstances in which there are varying degrees of ambiguity or robustness in the connections between aspects, rather than purely binary interactions, cubic fuzzy graphs ( C F G s ) are more adaptable and compatible than fuzzy graphs. To better represent the complexity of interactions or linkages in the real world, an emerging C F G can be very helpful in achieving better problem-solving abilities that specialize in domains like network analysis, the social sciences, information retrieval, and decision support systems. This idea can be used for a variety of uncertainty-related issues and assist decision-makers in selecting the best course of action through the use of a C F G . Enhancing the maximized network of three cubic fuzzy graphs’ decision-making efficiency was the ultimate objective of this study. We introduced the maximal product of three cubic fuzzy graphs to investigate how interval-valued fuzzy membership, fuzzy membership, and the miscellany of relations are all simultaneously supported through the aspect of degree and total degree of a vertex. Furthermore, the domination on the maximal product of three C F G s was illustrated to analyze the minimum domination number of the weighted C F G , and the proposed approach is illustrated with applications.
MSC:
05C07; 05C62; 05C69; 05C75; 05C90

1. Introduction

Graph theory in mathematics is practically applied to modeling various problems and occurrences from real-world scenarios. Graphs provide a straightforward method for presenting and visualizing data, such as the interconnections among various entities. Models based on fuzzy environments must be used when there is a lack of confidence in the link between items. A pivotal concept in the domain emerged from the innovative perspective that Zadeh [1] introduced in 1965 with his exposition of fuzzy sets. This notion swiftly garnered widespread momentum across diverse scientific disciplines, encompassing computer science, artificial intelligence, information science, system science, control engineering, management science, operations research, robotics, and theoretical mathematics. A decade after the initial introduction of fuzzy sets, Zadeh presented the concept of an interval-valued fuzzy set, a specialized subset of fuzzy sets characterized by membership values that are intervals ranging from 0 to 1, instead of fuzzy integers. In 1973, Kauffman [2] introduced the notion of fuzzy graphs, which gave rise to different types of graphs. Rosenfeld [3] established fuzzy graph theory in 1975, advancing the field of graph theory. He elucidated several concepts within fuzzy graphs, including trees, cut vertices, cycles, bridges, and terminal vertices. Researchers have explored various types of fuzzy graphs extensively. Talebi [4] conducted a study on Kayley fuzzy graphs. Borzooei et al. [5,6] undertook numerous studies on indeterminate graphs. As a further development of fuzzy sets, Atanassov [7] introduced the notion of intuitionistic fuzzy sets. In 2011, Akram and Dudek [8] proposed the concept of interval-valued fuzzy graphs. Subsequently, Talebi et al. [9,10] presented some innovative concepts concerning interval-valued intuitionistic fuzzy graphs. Kosari et al. [11,12,13] investigated recent developments in the areas of vague graphs and indistinct graph topologies. Rao et al. [14,15] defined the concepts of equitable dominant sets and dominating sets within ambiguous graphs. Shi et al. [16] explored several dominating properties in product-ambiguous graphs. The initial introduction of intuitionistic fuzzy graphs was by Shao et al. [17], and it found applications in supply systems. In 2006, Sampathkumar [18] expanded the concept of graph structures to include signed graphs and graphs with colored or annotated edges. Given that uncertainty and ambiguity often manifest through two or more distinct interactions in numerous real-world scenarios, fuzzy graph structures hold greater significance than traditional graph structures. Dinesh et al. [19] introduced the notion of fuzzy graph structures, discussing several related properties. Akram [20] presented new insights into m-polar fuzzy graphs. Akram and Akmal investigated the concepts of intuitionistic and bipolar fuzzy graph structures in their work [21]. Akram et al. expanded upon this by defining novel operations for fuzzy graph structures [22,23,24]. Kou et al. delved into the structure of fuzzy graphs [25]. In 2020, Dinesh introduced the concept of fuzzy incidence graph structures as a continuation of his research [26]. Utilizing q-rung ortho-pair fuzzy graph structures, Akram and Sitara developed a decision-making method [27]. Furthermore, Sitara and Zafar explored the application of q-rung ortho-pair fuzzy graph structures in airline services [28]. Previously, the only options for fuzzy graphs were interval-valued fuzzy membership or degrees of fuzzy membership. To provide a more versatile tool for simulating uncertainty and ambiguity, Jun et al. [29] introduced the concept of a cubic fuzzy set ( C F S ), which combines a fuzzy set and an interval-valued fuzzy set. Utilizing a C F S can help address various problems related to uncertainty and assist decision-makers in selecting the best option. Furthermore, Jun et al. [30] extended this concept by combining the neutrosophic complex with a C F S , proposing the idea of a neutrosophic C F S . They also explored C F S -based algebraic properties such as cubic interval-valued intuitionistic fuzzy graphs [31], cubic structures [32], cubic sets in semigroups [33], cubic soft sets [34], and cubic intuitionistic structures [35]. Muhiuddin et al. [36] introduced the concept of stable C F S s. The study of cubic fuzzy graphs ( C F G s ) and the concept of regularity were explored by Krishna Kumar et al. [37]. Rashid et al. [38] were the first to present the notion of a C F G , proposing several novel graph types and their applications. Furthermore, Muhiuddin et al. [39] offered a revised definition of a C F G , along with concepts concerning strong edges, paths, path strength, bridges, and cut vertices. Rashmanlou et al. [40,41] discussed some principles of C F G s. Rao et al. [42] investigated the maximal product in cubic fuzzy graph structures. Meenakshi et al. [43] studied the intuitionistic fuzzy network using efficient domination and continued the study on equitable domination in neutrosophic graphs using strong arcs [44]. Muhiuddin et al. [45] defined new concepts of domination in cubic graphs. Meenakshi et al. [46] introduced the graph operation of a maximal product on three single-valued neutrosophic graphs and attained the most efficient network for collaboration by finding the minimal spanning tree of the weighted social network. And later, they studied the various operations of single-valued neutrosophic graphs to find an optimal network [47]. When it becomes unfeasible to assign either two fuzzy memberships or two interval-valued memberships to indeterminate variables, the cubic fuzzy graph ( C F G ) emerges as a preferable modeling alternative. This is because it allocates two membership values to each vertex simultaneously. The complexity of the issue increases when numerous connections exist between vertices. In this context, one novel fuzzy graph that could prove extremely beneficial for problem-solving is the C F G . Researchers conducted a study on two cubic fuzzy graph operations on Cartesian, maximal, residue, composition, and direct products. In this study, the concept of a C F G was introduced using three C F G s and briefly described. Subsequently, we examined the attributes of the maximal product derived from three C F G s. The research encompasses various aspects, including the determination of a vertex’s degree and total degree within the maximal product of three C F G s, along with its computation methods, which were used to identify the decision-making efficiency of the network using the domination parameter. Finally, an application of a C F G is illustrated.

2. Preliminaries

In this section, a few foundational concepts are reviewed before the main discussion begins.
A graph, G = ( V , E ) , consists of a non-empty set of V with E 1 , E 2 , E 3 , ,   E k relations with V , which are all mutually disjoint, and each E i is symmetric and irreflexive for i = 1,2,…, k .
Definition 1 ([3]). 
A pair, G = ( ϕ , μ ), represents a fuzzy graph on a non-empty set of V , where ϕ is the fuzzy subset of V , and μ is the fuzzy relation with ϕ, such that
μ ( x ,   y ) ϕ ( x ) ϕ ( y ) ,   ( x ,   y ) V .
Definition 2 ([42]). 
An interval-valued fuzzy set ( V F S ), J , is defined as J = { [ α ( k ) , β ( k ) ] | k V } , where α and β are a fuzzy set of V so that α ( k ) β ( k ) , for all k V .
For two IVFSs, L   and M , we define the following:
L   M     { [ α L ( k ) α M ( k ) ,   β L ( k ) β M ( k ) ]   |   k V } ,
L   M     { [ α L ( k ) α M ( k ) ,   β L ( k ) β M ( k ) ]   |   k V } .
Definition 3 ([17]). 
A cubic fuzzy set ( C F S ) of C s on a non-empty set of V is defined as C s = { [ α ( k ) , β ( k ) ] ,   γ ( k ) | k V } , where [ α ( k ) , β ( k ) ] is the interval-valued fuzzy membership degree, and γ ( k ) is the fuzzy membership degree of k . If γ ( k ) [ α ( k ) , β ( k ) ] , then it is called an internal cubic fuzzy set, and if γ ( k ) [ α ( k ) , β ( k ) ] , then it is called as external cubic fuzzy set.
Definition 4 ([42]). 
Let G c = ( L , W ) be a pair on a non-empty set of V that is said to be a cubic fuzzy graph ( C F G ) where L is a cubic fuzzy set on V , and W is a cubic fuzzy set on V × V , so that, for all, p q   M ,
α M ( p q )   α L ( p ) α L ( q ) ,
  β L ( p q ) β L ( p ) β L ( q ) ,
γ M ( p q )   γ L ( p ) γ L ( q ) .
Definition 5 ([45]). 
The F G   G c is said to be complete if p , q V
α M ( p q ) =   α L ( p ) α L ( q ) ,
β M ( p q ) =   β L ( p ) β L ( q ) ,
γ M ( p q ) = γ L ( p ) γ L ( q ) .
Definition 6 ([42]). 
The F G   G c = ( L , M 1 ,   M 2 , ,   M r ) is said to be M j strong if p q E j
α M j ( p q ) = α L ( p ) α L ( q ) ,
β M j ( p q ) =   β L ( p ) β L ( q ) ,
  γ M j ( p q ) = γ L ( p ) γ L ( q ) .
If G c , is M j strong for all j = 1 , 2 , , r , then G c is called a strong C F G .
Definition 7 ([42]). 
Let V be a non-empty set and G = ( V , E 1 ,   E 2 , ,   E r ) be a graph. Then, G c = ( L , M 1 ,   M 2 , ,   M r ) is a cubic fuzzy graph ( C F G ) on G if L is a cubic fuzzy set on V , and M is a cubic fuzzy set on E 1 ,   E 2 , ,   E r . Then, the maximal product of two C F G s   i s   d e f i n e d   a s   f o l l o w s :
α M j ( p q )   α L ( p ) α L ( q ) ,
β M j ( p q )   β L ( p ) β L ( q ) ,
γ M j ( p q )   γ L ( p ) γ L ( q ) .       For all   p q   M j and     j = 1 , 2 , , r .
If p q  ∈ S u p p ( M j ) , then p q is known as the M j -edge of F G   G c . Moreover, M 1 ,   M 2 , ,   M r are mutually disjoint such that each α j , β j   a n d   γ j is symmetric and reflexive for 1 j r .
Definition 8 ([42]). 
The degree of a vertex in the maximal product G c = ( L , M 1 ,   M 2 , ,   M r ) of two F G s ,   G c = ( L , M 1 ,   M 2 , ,   M r ) and G c = ( L , M 1 ,   M 2 , ,   M r ) , is defined as follows:
D G c ( j p , k q ) = [ D α ( j p , k q ) , D β ( j p , k q ) ] , D γ ( j p , k q )   w h e r e ,
D α ( j p , k q ) = j a j p E i , k b = k q α W i ( j a j p ) α L ( k q ) + k b k q E i , j a = j p α M i ( k b k q ) α L ( j p )
D β ( j p , k q ) = j a j p E i , k b = k q β W i ( j a j p ) β L ( k q ) + k b k q E i , j a = j p β M i ( k b k q ) β L ( j p )
D γ ( j p , k q ) = j a j p E i , k b = k q γ W i ( j a j p ) γ L ( k q ) + k b k q E i , j a = j p γ M i ( k b k q ) γ L ( j p )
Definition 9 ([42]). 
The total degree of a vertex in the maximal product, G c = ( L , M 1 ,   M 2 , ,   M r ) , of two F G s , G c = ( L , M 1 ,   M 2 , ,   M r ) and G c = ( L , M 1 ,   M 2 , ,   M r ) , is defined as follows:
T D G c ( j p , k q ) = [ T D α ( j p , k q ) , T D β ( j p , k q ) ] , T D γ ( j p , k q )   where,
T D α ( j p , k q ) = j a j p E i , k b = k q α W i ( j a j p ) α L ( k q ) + k b k q E i , j a = j p α M i ( k b k q ) α L ( j p )
T D β ( j p , k q ) = j a j p E i , k b = k q β W i ( j a j p ) β L ( k q ) + k b k q E i , j a = j p β M i ( k b k q ) β L ( j p )
T D γ ( j p , k q ) = j a j p E i , k b = k q γ W i ( j a j p ) γ L ( k q ) + k b k q E i , j a = j p γ M i ( k b k q ) γ L ( j p )
Definition 10 ([45]). 
The cardinality of a vertex, x V , in a C F G ,   G c = ( L , M ) is defined using
= x V ( 1 μ L L ( x ) + μ L U ( x ) + σ L ( x ) 3 )
The cardinality of an edge, x y E , in a C F G , G c = ( L , M ) , is defined using
M = x y E ( 1 μ M L ( x y ) + μ M U ( x y ) + σ M ( x y ) 3 )
Definition 11 ([45]). 
Let C F G ,   G c = ( L , M ) , be a C F G over V and x , y V , and then x dominates if there exists a strong cubic edge between x and y .
Definition 12 ([45]). 
Let C F G ,   G c = ( L , M ) , be a C F G over V , and S V is called the dominating set in G c if, for every y S , there exists x S such that x dominates y . The minimum cardinality of all dominating sets in   G c is called the domination number of   G c and denoted as γ   C F G ( G c ) .

3. Maximal Product of Three Cubic Fuzzy Graphs

Let G = ( ϕ , μ ) be a fuzzy graph with the underlying crisp graph G = ( V , E 1 ,   E 2 , ,   E r ) if we frame the maximal product of two fuzzy graphs, G 1 and G 2 , which maximizes only the membership value of the maximal product, whereas in an intuitionistic fuzzy graph, it defines both truth and falsity membership values of the maximal product. In a neutrosophic graph, it maximizes the truth, indeterminacy, and falsity membership values of the maximal product. But in a cubic fuzzy graph, the membership value is defined in both interval-valued and fuzzy values. When three distinct types of cubic fuzzy graph attributes are maximized, their optimal level is characterized as the interval-valued membership value or the fuzzy membership value, which is more efficient than other types of fuzzy graphs. Maximizing the product operation in cubic fuzzy graphs offers us an abundance of opportunities to solve multidimensional attributes. This strategy not only broadens the range of applications but also improves the efficiency and efficacy of solutions across several areas.
Let G c = ( L , M 1 ,   M 2 , ,   M r ) , G c = ( L , M 1 ,   M 2 , ,   M r ) , and G c = ( L , M 1 ,   M 2 , ,   M r ) be three C F G s with underlying crisp graphs G = ( V , E 1 ,   E 2 , ,   E r ), G = ( V , E 1 ,   E 2 , ,   E r ), and G = ( V , E 1 ,   E 2 , ,   E r ), respectively. Then, G c M P G c M P G c = ( L M P L M P L ,   M M P M M P M ) = ( L , M 1 ,   M 2 , ,   M r ) is the maximal product of G c ,   G c and G c . Where V = V × V × V and ε r = { ( j 1 , k 1 , s 1 ) ( j 2 , k 2 , s 2 ) | j 1 = j 2 , k 1 = k 2 , s 1 s 2 E r   or   j 1 = j 2 , s 1 = s 2 , k 1 k 2 E r   or   k 1 = k 2 , s 1 = s 2 , j 1 j 2 E r }, and it is defined as
L ( j , k , s ) = ( L M P L M P L ) ( j , k , s ) = { α L ( j ) α L ( k ) α L ( s ) β L ( j ) β L ( k ) β L ( s ) γ L ( j ) γ L ( k ) γ L ( s )  
M i ( j 1 , k 1 , s 1 ) ( j 2 , k 2 , s 2 ) = { { α L ( j 1 ) α L ( k 1 ) α M i ( s 1 s 2 ) ,   j 1 = j 2 ,   k 1 = k 2 ,   s 1 s 2 E i α L ( k 1 ) α L ( s 1 ) α M i ( j 1 j 2 ) ,   k 1 = k 2 ,   s 1 = s 2 ,   j 1 j 2 E i α L ( j 1 ) α L ( s 1 ) α M i ( k 1 k 2 ) ,   j 1 = j 2 ,   s 1 = s 2 ,   k 1 k 2 E i { β L ( j 1 ) β L ( k 1 ) β M i ( s 1 s 2 ) ,   j 1 = j 2 ,   k 1 = k 2 ,   s 1 s 2 E i β L ( k 1 ) β L ( s 1 ) β M i ( j 1 j 2 ) ,   k 1 = k 2 ,   s 1 = s 2 ,   j 1 j 2 E i β L ( j 1 ) β L ( s 1 ) β M i ( k 1 k 2 ) ,   j 1 = j 2 ,   s 1 = s 2 ,   k 1 k 2 E i { γ L ( j 1 ) γ L ( k 1 ) γ M i ( s 1 s 2 ) ,   j 1 = j 2 ,   k 1 = k 2 ,   s 1 s 2 E i γ L ( k 1 ) γ L ( s 1 ) γ M i ( j 1 j 2 ) ,   k 1 = k 2 ,   s 1 = s 2 ,   j 1 j 2 E i γ L ( j 1 ) γ L ( s 1 ) γ M i ( k 1 k 2 ) ,   j 1 = j 2 ,   s 1 = s 2 ,   k 1 k 2 E i
for   all   ( j , k , s )   V and i = 1 , 2 , , r .
Theorem 1. 
The maximal product of three strong C F G s is also a strong C F G .
Proof. 
Let G c = ( L , M 1 ,   M 2 , ,   M r ) , G c = ( L , M 1 ,   M 2 , ,   M r ) , and G c = ( L , M 1 ,   M 2 , ,   M r ) be three strong C F G s. Then, α W i ( j 1 j 2 ) = α L ( j 1 ) α L ( j 2 ) for any j 1 j 2 E i , α W i ( k 1 k 2 ) = α L ( k 1 ) α L ( k 2 ) for any k 1 k 2 E i , and α W i ( s 1 s 2 ) = α L ( s 1 ) α L ( s 2 ) for any s 1 s 2 E i , i = 1 , 2 , , r . Then, according to the definition of the maximal product,
Case (i): j 1 = j 2 , k 1 = k 2 , s 1 s 2 E i , then
α M i ( ( j 1 , k 1 , s 1 ) ( j 2 , k 2 , s 2 ) ) = α L ( j 1 ) α L ( k 1 ) α M i = α L ( j 1 ) α L ( k 1 ) [ α L ( s 1 ) α L ( s 2 ) ] = [ α L ( j 1 ) α L ( k 1 ) α L ( s 1 ) ] [ α L ( j 1 ) α L ( k 1 ) α L ( s 2 ) ] = α L ( j 1 , k 1 , s 1 )   α L ( j 2 , k 2 , s 2 )
Case (ii): j 1 = j 2 , s 1 = s 2 , k 1 k 2 E i , then
  α M i ( ( j 1 , k 1 , s 1 ) ( j 2 , k 2 , s 2 ) ) = α L ( j 1 ) α L ( s 1 ) α M i ( k 1 k 2 ) = α L ( j 1 ) α L ( s 1 ) [ α L ( k 1 ) α L ( k 2 ) ] = [ α L ( j 1 ) α L ( s 1 ) α L ( k 1 ) ] [ α L ( j 1 ) α L ( k 2 ) α L ( s 1 ) ] = α L ( j 1 , k 1 , s 1 )   α L ( j 2 , k 2 , s 2 )
Case (iii): k 1 = k 2 , s 1 = s 2 , j 1 j 2 E i , then
          α M i ( ( j 1 , k 1 , s 1 ) ( j 2 , k 2 , s 2 ) ) = α L ( k 1 ) α L ( s 1 ) α M i ( j 1 j 2 ) = α L ( k 1 ) α L ( s 1 ) [ α L ( j 1 ) α L ( j 2 ) ] = [ α L ( j 1 ) α L ( s 1 ) α L ( k 1 ) ] [ α L ( j 2 ) α L ( k 1 ) α L ( s 1 ) ] = α L ( j 1 , k 1 , s 1 )   α L ( j 2 , k 2 , s 2 )
Therefore, α M i ( ( j 1 , k 1 , s 1 ) ( j 2 , k 2 , s 2 ) ) = α L ( j 1 , k 1 , s 1 ) α L ( j 2 , k 2 , s 2 ) for all edges of the maximal product of G c , G c and G c . Similarly,
β M i ( ( j 1 , k 1 , s 1 ) ( j 2 , k 2 , s 2 ) ) = β L ( j 1 , k 1 , s 1 )   β L ( j 2 , k 2 , s 2 ) ,
γ M i ( ( j 1 , k 1 , s 1 ) ( j 2 , k 2 , s 2 ) ) = γ L ( j 1 , k 1 , s 1 )   γ L ( j 2 , k 2 , s 2 )
Hence, G c = G c M P G c M P G c = ( L , M 1 ,   M 2 , ,   M r ) is a strong C F G .
Theorem 2. 
The maximal product of three connected C F G s is also a connected C F G .
Proof. 
Let G c = ( L , M 1 ,   M 2 , ,   M r ) , G c = ( L , M 1 ,   M 2 , ,   M r ) , and G c = ( L , M 1 ,   M 2 , ,   M r ) be three finite and connected C F G s with underlying crisp graphs G = ( V , E 1 ,   E 2 , ,   E r ), G = ( V , E 1 ,   E 2 , ,   E r ), and G = ( V , E 1 ,   E 2 , ,   E r ), respectively.
Since, G c , G c , and G c are three connected C F G s,
α M i ( o a , o b ) > 0 ,   β M i ( o a , o b ) > 0 ,   γ M i ( o a , o b ) > 0 ,   f o r   a l l   o a , o b V
α M i ( p m , p n ) > 0 ,   β M i ( p m , p n ) > 0 ,   γ M i ( p m , p n ) > 0 ,   f o r   a l l   p m , p n V
α M i ( q e , q f ) > 0 ,   β M i ( q e , q f ) > 0 ,   γ M i ( q e , q f ) > 0 ,   f o r   a l l   q e , q f V
Let G c = ( L , M 1 ,   M 2 , ,   M o ) be the maximal product of G c , G c , and G c .
For every vertex o a , o b V ,   p m , p n V ,   q e , q f V and ( o a p m q e ) , ( o b p n q f ) V × V × V
α M i ( ( o a , p m , q e ) ( o b , p n , q f ) ) = α L ( o a ) α L ( p m ) α M i = α L ( o a ) α L ( p m ) [ α L ( q e ) α L ( q f ) ] = α L ( o a , p m , q e )   α L ( o b , p n , q f )
Similarly ,   β M i ( ( o a , p m , q e ) ( o b , p n , q f ) ) = β L ( o a , p m , q e )   β L ( o b , p n , q f ) ,
γ M i ( ( o a , p m , q e ) ( o b , p n , q f ) ) = γ L ( o a , p m , q e )   γ L ( o b , p n , q f )
According to the definition of the maximal product, it is obvious that ( o a , p m , q e ) ( o b , p n , q f ) is connected.
Therefore,
α M i ( ( o a p m q e ) , ( o b p n q f ) ) > 0 , β M i ( ( o a p m q e ) , ( o b p n q f ) ) > 0 , γ M i ( ( o a p m q e ) , ( o b p n q f ) ) > 0
for all ( o a p m q e ) , ( o b p n q f )   E r . Thus, G c is a connected C F G . □

3.1. Definition

The degree of a vertex in the maximal product G c = ( L , M 1 ,   M 2 , ,   M r ) of three C F G s , G c = ( L , M 1 ,   M 2 , ,   M r ) , G c = ( L , M 1 ,   M 2 , ,   M r ) , and G c = ( L , M 1 ,   M 2 , ,   M r ) , represented in Figure 1, Figure 2 and Figure 3, is defined as
D G c ( o x , p y , q z ) = [ D α ( o x , p y , q z ) , D β ( o x , p y , q z ) ] , D γ ( o x , p y , q z )
where
D α ( o x , p y , q z ) = o a o x E i , p b = p y , q c = q z α W i ( o a o x ) α L ( p y ) α L ( q z )   + p b p y E i , o a = o x , q c = q z α W i ( p b p y ) α L ( o x ) α L ( q z )   + q c q z E i , p b = p y , o a = o x α W i ( q c q z ) α L ( p y ) α L ( o x )
D β ( o x , p y , q z ) = o a o x E i , p b = p y , q c = q z β W i ( o a o x ) β L ( p y ) β L ( q z )   + p b p y E i , o a = o x , q c = q z β W i ( p b p y ) β L ( o x ) β L ( q z )   + q c q z E i , p b = p y , o a = o x β W i ( q c q z ) β L ( p y ) β L ( o x )
D γ ( o x , p y , q z ) = o a o x E i , p b = p y , q c = q z γ W i ( o a o x ) γ L ( p y ) γ L ( q z )   + p b p y E i , o a = o x , q c = q z γ W i ( p b p y ) γ L ( o x ) γ L ( q z )   + q c q z E i , p b = p y , o a = o x γ W i ( q c q z ) γ L ( p y ) γ L ( o x )
M j , the degree of a vertex of maximal product, G c = G c M P G c M P G c , is determined as D M j ( o x , p y , q z ) = [ D α j ( o x , p y , q z ) , D β j ( o x , p y , q z ) ] , D γ j ( o x , p y , q z ) .

3.2. Definition

The total degree of a vertex in the maximal product G c = ( L , M 1 ,   M 2 , ,   M r ) of three F G s , G c = ( L , M 1 ,   M 2 , ,   M r ) , G c = ( L , M 1 ,   M 2 , ,   M r ) , and G c = ( L , M 1 ,   M 2 , ,   M r ) , is defined as
T D G c ( o x , p y , q z ) = [ T D α ( o x , p y , q z ) , T D β ( o x , p y , q z ) ] , T D γ ( o x , p y , q z ) ,
where
T D α ( o x , p y , q z ) = o a o x E i , p b = p y , q c = q z α W i ( o a o x ) α L ( p y ) α L ( q z )   + p b p y E i , o a = o x , q c = q z α W i ( p b p y ) α L ( o x ) α L ( q z )   + q c q z E i , p b = p y , o a = o x α W i ( q c q z ) α L ( p y ) α L ( o x ) + α L ( o x , p y , q z )
T D β ( o x , p y , q z ) = o a o x E i , p b = p y , q c = q z β W i ( o a o x ) β L ( p y ) β L ( q z )   + p b p y E i , o a = o x , q c = q z β W i ( p b p y ) β L ( o x ) β L ( q z )   + q c q z E i , p b = p y , o a = o x β W i ( q c q z ) β L ( p y ) β L ( o x ) + β L ( o x , p y , q z )
T D γ ( o x , p y , q z ) = o a o x E i , p b = p y , q c = q z γ W i ( o a o x ) γ L ( p y ) γ L ( q z )   + p b p y E i , o a = o x , q c = q z γ W i ( p b p y ) γ L ( o x ) γ L ( q z )   + q c q z E i , p b = p y , o a = o x γ W i ( q c q z ) γ L ( p y ) γ L ( o x ) + γ L ( o x , p y , q z )
The degree and total degree of each vertex present in the maximal product G c (Figure 4 and Figure 5) are computed as follows:
D α ( o 1 , p 1 , q 1 ) = α W i ( o 1 o 2 ) α L ( p 1 ) α L ( q 1 ) + α W i ( p 1 p 2 ) α L ( o 1 ) α L ( q 1 ) + α W i ( q 1 q 2 ) α L ( o 1 ) α L ( p 1 ) = ( 0.35 0.45 0.20 ) + ( 0.30 0.35 0.20 ) + ( 0.70 0.35 0.45 ) = 1.5
D β ( o 1 , p 1 , q 1 ) = β W i ( o 1 o 2 ) β L ( p 1 ) β L ( q 1 ) + β W i ( p 1 p 2 ) β L ( o 1 ) β L ( q 1 ) + β W i ( q 1 q 2 ) β L ( o 1 ) β L ( p 1 ) = ( 0.55 0.80 0.70 ) + ( 0.60 0.50 0.70 ) + ( 0.80 0.80 0.50 ) = 2.3
D γ ( o 1 , p 1 , q 1 ) = γ W i ( o 1 o 2 ) γ L ( p 1 ) γ L ( q 1 ) + γ W i ( p 1 p 2 ) γ L ( o 1 ) γ L ( q 1 ) + γ W i ( q 1 q 2 ) γ L ( o 1 ) γ L ( p 1 ) = ( 0.75 0.55 0.50 ) + ( 0.45 0.65 0.50 ) + ( 0.95 0.65 0.55 ) = 2.35
Therefore, the degree of the vertex ( o 1 , p 1 , q 1 )   is     D G c ( o 1 , p 1 , q 1 ) = ⟨[1.5, 2.3], 2.35⟩.
Similarly,   D G c ( o 1 , p 1 , q 2 ) = ⟨[1.5, 2.35], 2.4⟩,   D G c ( o 1 , p 2 , q 1 ) = ⟨[1.4, 2.2], 2.35⟩,   D G c ( o 1 , p 2 , q 2 ) = ⟨[1.4, 2.4], 2.35⟩,   D G c ( o 2 , p 1 , q 1 ) = ⟨[1.7, 2.4], 2.4⟩,   D G c ( o 2 , p 1 , q 2 ) = ⟨[1.7, 2.4], 2.4⟩,   D G c ( o 2 , p 2 , q 1 ) = ⟨[1.6, 2.3], 2.4⟩,   D G c ( o 2 , p 2 , q 2 ) = ⟨[1.6, 2.4], 2.4⟩.
Also, the total degree of each vertex is as follows:
  T D G c ( o 1 , p 1 , q 1 ) = [ 1.95 ,   3.15 ] ,   2.9 ,     T D G c ( o 1 , p 1 , q 2 ) = [ 1.85 ,   3.15 ] ,   3.05 ,     T D G c ( o 1 , p 2 , q 1 ) = [ 1.65 ,   2.9 ] ,   2.85 ,     T D G c ( o 1 , p 2 , q 2 ) = [ 1.75 ,   3.2 ] ,   3 ,     T D G c ( o 2 , p 1 , q 1 ) = [ 2.25 ,   3.2 ] ,   3.1 ,     T D G c ( o 2 , p 1 , q 2 ) = [ 2.05 ,   3.2 ] ,   3.05 ,     T D G c ( o 2 , p 2 , q 1 ) = [ 2.15 ,   3.1 ] ,   3.1 ,     T D G c ( o 2 , p 2 , q 2 ) = [ 1.95 ,   3.2 ] ,   3.05

4. Domination on Maximal Product of Cubic Fuzzy Graph

To analyze the dominating sets of the maximized C F G , the cardinality of the vertices and edges is calculated to find the minimum domination number of the weighted C F G network (Figure 6, Figure 7, Figure 8, Figure 9 and Figure 10). Muhiuddin et al. [43] proposed the domination in C F G s via strong edges using the vertex and edge cardinality of the graphs. The weighted maximized C F G   G c = G c M P G c M P G c = ( L , M 1 ,   M 2 , ,   M r ) is represented in Figure 10, and its minimal dominating sets are as follows:
S 1 = { j 2 k 1 s 2 , j 1 k 2 s 1 , j 2 k 2 s 2 , j 1 k 3 s 1 }
S 2 = { j 2 k 1 s 2 , j 2 k 1 s 1 , j 2 k 2 s 1 , j 1 k 3 s 2 }
S 3 = { j 1 k 1 s 1 , j 2 k 1 s 2 , j 1 k 2 s 2 , j 1 k 3 s 1 , j 1 k 3 s 2 }
The vertex cardinality of the members of the above dominating sets are
j 2 k 1 s 2 = 1.9 ,   j 1 k 2 s 1 = 1.9 ,   j 2 k 2 s 2 = 2.2 ,   j 1 k 3 s 1 = 1.9 ,   j 1 k 3 s 2 = 1.9 ,   j 2 k 2 s 1 = 1.9 ,   j 1 k 3 s 1 = 1.9 ,   j 2 k 1 s 1 = 1.9 ,   j 1 k 1 s 1 = 1.9 ,   j 1 k 2 s 2 = 1.9
The cardinality of the dominating sets S 1 ,   S 2 ,   S 3 are
S 1 ( G c M P G c M P G c ) = 1.9 + 1.9 + 2.2 + 1.9 = 7.9
S 2 ( G c M P G c M P G c ) = 1.9 + 1.9 + 1.9 + 1.9 = 7.6
S 3 ( G c M P G c M P G c ) = 1.9 + 1.9 + 1.9 + 1.9 + 1.9 = 9.5   respectively .
The domination number of G c M P G c M P G c is 7.6, which is obtained from the dominating set S 2 .
The degree and total degree of each vertex present in the maximal product G c (Figure 9) are computed as follows:
D α ( j 1 , k 1 , s 1 ) = α W i ( j 1 j 2 ) α L ( k 1 ) α L ( s 1 ) + α W i ( k 1 k 2 ) α L ( j 1 ) α L ( s 1 ) + α W i ( k 2 k 3 ) α L ( j 1 ) α L ( s 1 ) + α W i ( s 1 s 2 ) α L ( j 1 ) α L ( k 1 ) = ( 0.5 0.3 0.6 ) + ( 0.1 0.2 0.6 ) + ( 0.2 0.2 0.6 ) + ( 0.5 0.2 0.3 ) = 2.3
D β ( j 1 , k 1 , s 1 ) = β W i ( j 1 j 2 ) β L ( k 1 ) β L ( s 1 ) + β W i ( k 1 k 2 ) β L ( j 1 ) β L ( s 1 ) + β W i ( k 2 k 3 ) β L ( j 1 ) β L ( s 1 ) + β W i ( s 1 s 2 ) β L ( j 1 ) β L ( k 1 ) = ( 0.7 0.6 0.8 ) + ( 0.6 0.6 0.8 ) + ( 0.5 0.6 0.8 ) + ( 0.6 0.6 0.6 ) = 3.0
D γ ( j 1 , k 1 , s 1 ) = γ W i ( j 1 j 2 ) γ L ( k 1 ) γ L ( s 1 ) + γ W i ( k 1 k 2 ) γ L ( j 1 ) γ L ( s 1 ) + γ W i ( k 2 k 3 ) γ L ( j 1 ) γ L ( s 1 ) + γ W i ( s 1 s 2 ) γ L ( j 1 ) γ L ( k 1 ) = ( 0.8 0.5 0.7 ) + ( 0.5 0.7 0.7 ) + ( 0.7 0.7 0.7 ) + ( 0.5 0.5 0.7 ) = 2.9
Therefore, the degree of the vertex ( j 1 , k 1 , s 1 ) is   D G c ( j 1 , k 1 , s 1 ) = ⟨[2.3, 2.9], 2.9⟩.
Similarly,   D G c ( j 1 , k 2 , s 1 ) = ⟨[2.3, 2.9], 2.9⟩,   D G c ( j 1 , k 3 , s 1 ) = ⟨[2.4, 3.0], 3.0⟩
  D G c   ( j 1 , k 1 , s 2 ) = [ 1.9 ,   2.7 ] ,   2.9 ,       D G c   ( j 1 , k 2 , s 2 ) = [ 1.9 ,   2.7 ] ,   2.9   D G c   ( j 1 , k 3 , s 2 ) = [ 2.0 ,   2.8 ] ,   3.0 ,       D G c   ( j 2 , k 1 , s 1 ) = [ 2.3 ,   3.1 ] ,   2.9   D G c   ( j 2 , k 2 , s 1 ) = [ 2.3 ,   3.1 ] ,   2.9 ,       D G c   ( j 2 , k 3 , s 1 ) = [ 2.4 ,   3.1 ] ,   3.0 ,     D G c   ( j 2 , k 1 , s 2 ) = [ 1.8 ,   3.1 ] ,   2.8 ,       D G c   ( j 2 , k 2 , s 2 ) = [ 1.8 ,   3.1 ] ,   2.8 ,   D G c   ( j 2 , k 3 , s 2 ) = [ 2.0 ,   3.1 ] ,   3.0 ,  
Also, the total degree of each vertex is as follows:
T D α ( j 1 , k 1 , s 1 ) = α W i ( j 1 j 2 ) α L ( k 1 ) α L ( s 1 ) + α W i ( k 1 k 2 ) α L ( j 1 ) α L ( s 1 ) + α W i ( k 2 k 3 ) α L ( j 1 ) α L ( s 1 ) +   α W i ( s 1 s 2 ) α L ( j 1 ) α L ( k 1 ) + α L ( j 1 , k 1 , s 1 ) = ( 0.5 0.3 0.6 ) + ( 0.1 0.2 0.6 ) + ( 0.2 0.2 0.6 ) + ( 0.5 0.2 0.3 ) + 0.6 = 2.9
T D β ( j 1 , k 1 , s 1 ) = β W i ( j 1 j 2 ) β L ( k 1 ) β L ( s 1 ) + β W i ( k 1 k 2 ) β L ( j 1 ) β L ( s 1 ) + β W i ( k 2 k 3 ) β L ( j 1 ) β L ( s 1 ) +   β W i ( s 1 s 2 ) β L ( j 1 ) β L ( k 1 ) + β L ( j 1 , k 1 , s 1 ) = ( 0.7 0.6 0.8 ) + ( 0.6 0.6 0.8 ) + ( 0.5 0.6 0.8 ) + ( 0.6 0.6 0.6 ) + 0.7 = 3.7
T D γ ( j 1 , k 1 , s 1 ) = γ W i ( j 1 j 2 ) γ L ( k 1 ) γ L ( s 1 ) + γ W i ( k 1 k 2 ) γ L ( j 1 ) γ L ( s 1 ) + γ W i ( k 2 k 3 ) γ L ( j 1 ) γ L ( s 1 ) +   γ W i ( s 1 s 2 ) γ L ( j 1 ) γ L ( k 1 ) + γ L ( j 1 , k 1 , s 1 ) = ( 0.8 0.5 0.7 ) + ( 0.5 0.7 0.7 ) + ( 0.7 0.7 0.7 ) + ( 0.5 0.5 0.7 ) + 0.8 = 3.7

5. Applications

5.1. Telecommunication Network

Telecommunications network businesses frequently combine or form partnerships, necessitating the integration of separate networks to create a unified service network. For example, if three mobile carriers merge, their distinct cellular networks (each depicted as a graph with nodes as cell towers and edges as communication lines) are joined to provide seamless service coverage and greater redundancy, and additional linkages may be established between the nearest or most strategic towers of the various networks. This approach includes determining each connection’s capacity to handle the projected load and updating infrastructure as needed.

5.2. Emergency Services Coordination

Integrating communication networks for police, fire, and medical services may significantly improve response times and coordination in emergency situations. Each service may have its own dispatch and communication network, and integrating these can improve information and resource-sharing, particularly during large-scale crises.

5.3. Research Collaboration Network

In academia and research, connecting the networks of various research institutes and databases enables scientists to interact effectively across boundaries. This involves exchanging research data, computing resources, and publishing databases in order to facilitate innovative research using a collaborative and integrated approach.

5.4. Traffic Management

Cities with complicated transportation networks benefit from combining traffic management, public transit, and emergency response systems. This type of connection enables real-time traffic monitoring, adaptive traffic signal regulation, and priority emergency vehicle routing, which greatly improves the traffic flow and reduces the emergency response time.

5.5. Financial Networks

When banks or financial service companies merge, it is critical to integrate their separate networks (ATMs, internet banking systems, etc.) to provide smooth service to customers. Each network can be represented as a different graph with nodes representing ATMs, branch locations, or servers and edges reflecting connection and transaction flows. The integration seeks to enhance consumer accessibility while reducing transaction times, maintaining a strong network capable of handling more data, and providing redundancy.

5.6. Airline and Defense Systems

In aerospace and the armed forces, combining communication, surveillance, and operational networks from various systems (satellites, ground stations, and airborne units) is essential in sustaining national security and carrying out coordinated missions. This includes maximizing network connection and redundancy to enable reliable communication and surveillance capabilities in all situations.

5.7. Network Security at Organizations

Data networks from different data centers are frequently integrated by technology organizations to maintain redundancy, balance loads, and improve data availability. This might entail linking network infrastructure across geographically separated data centers (each shown as a graph) via high-speed communication lines. The goal of optimization would be to reduce latency while increasing bandwidth, which is critical in maintaining high-speed access to cloud services and assuring disaster recovery capabilities.
In a corporate environment, a wide range of software and tools intended to foster collaboration, resource-sharing, and interaction within and between computer networks are known as networking applications. Standalone networks such as operations, security, and IT infrastructure networks can significantly enhance efficiency, security, and decision-making. This networking is essential in both entrepreneurial and private environments. By integrating these networks, a company achieves a holistic view of its operations, enabling more agile and informed decision-making. The seamless flow of information enhances operational efficiency, improves security posture, and supports strategic initiatives. This integrated approach not only streamlines internal processes but also enhances the company’s ability to respond to external challenges, such as market shifts or cybersecurity threats, ensuring a competitive edge in its industry. Even though operations, security, and IT infrastructure networks may have distinct objectives and requirements, aligning them can bring about significant benefits in organizational effectiveness and resilience.
Despite these networks possessing various goals, integrating these three networks into a cohesive whole presents a unique set of challenges but also offers significant benefits in terms of operational efficiency, enhanced security, and better decision-making capabilities. Security, core IT support, and operational procedures work together closely to be efficient. The management of these networks faces several challenges, such as preserving high security without compromising operational effectiveness and making adjustments to the quickly changing technical environment. The key to success lies in careful planning, rigorous security measures, and a commitment to continuous improvement. A maximized network structure allows for doing so. Flexibility is one of the main reasons why a network structure is implemented in the first place. The aim is to make the networking process more open, interesting, and effective. The effectiveness of the maximized network is established using the cubic fuzzy membership values.
Let us consider the above networks, G c , as shown in Figure 6, depicting the operations network. G c is represented in Figure 7 as the security network and G c ” in Figure 8 as the IT infrastructure network shown. In these figures, the nodes of the network G c   play the role of managing and carrying out an organization’s main business and operational procedures. This comprises the network that facilitates node j 1 , representing production, and node j 2   for manufacturing purposes, for which the processes, production lines, and machinery are managed via these systems to ensure reliability and efficiency with other systems. G c is a security network consisting of tools, guidelines, and procedures put in place to guard against damage, intrusion, and unauthorized access to a company’s devices, network infrastructure, and data. Here, the nodes k 1 represent an intrusion prevention system that regulates inbound and outgoing network traffic according to an organization’s security guidelines. k 2   represents the antivirus system, and k 3 is the security information management system for the analysis and logging of security alarms produced via network hardware and applications in real time. The G c network is crucial in preserving consumer trust, protecting an organization’s assets, and adhering to legal requirements. G c , as an IT infrastructure network, facilitates the provision of IT services and solutions to partners, clients, and staff. It consists of hardware in nodes s 1   and s 2   , which denote network services. As the backbone of the operations and security networks, the IT infrastructure network supplies the aspects required for networking, computation, and storage.
The maximized cubic fuzzy network G c achieves a holistic view of its operations, enabling more agile and informed decision-making. The seamless flow of information enhances operational efficiency, improves security posture, and supports strategic initiatives. Each node in the maximized network G c fulfils a specific set of responsibilities when it is combined in the maximized network. Here, node j 1 k 1 s 1 supports resource optimization that effectively processes, stores, and retrieves the data required for day-to-day business operations. Node j 1 k 2 s 1 enhances security monitoring throughout the company and the uniform execution of security measures. Node j 2 k 2 s 1 observes the reaction that facilitates broad data collection and analytics, offering a comprehensive picture of the operational and security posture of the company. Node j 1 k 2 s 2 performs data encryption and segmentation to safeguard sensitive data, while node j 2 k 2 s 2 is for planning, resilience, and so on.
The above maximized network includes nodes j 2 k 1 s 2 ,   j 2 k 1 s 1 ,   j 2 k 2 s 1 ,   j 1 k 3 s 2 , which form the dominating set with a minimal domination number. Consequently, these nodes collectively serve as a security stronghold due to network connectivity, and businesses can establish a cohesive security approach to enhance decision-making. The smooth data transfer among interconnected networks enhances decision-makers’ data accessibility. Improved operational performance and strategic planning can be achieved through enhanced decision-making, driven by flexibility, reduced downtime expenses, enhanced resilience, and real-time data analytics innovation. Influential nodes that dominate the maximized network play a crucial role in overseeing the network’s capabilities, ensuring alignment with the company’s strategic goals, and maintaining resilience and agility in the face of challenges and disruptions. To gain and retain control over the network’s operations and security, dominating nodes requires a combination of processes, technology, and knowledgeable workers. In a synergistic environment, security is tighter, operations are more efficient, and strategic flexibility is enhanced by connecting operations, security, and IT infrastructure networks. A contemporary, flexible business that can adapt to and prosper in the digital era is built on this integration by maximizing cubic fuzzy graphs.

6. Conclusions

Fuzzy graphs assist in identifying unclear problems. Cubic fuzzy graphs provide greater versatility in solving ambiguous situations. C F G s’ utilization of both fuzzy membership values and interval-valued fuzzy membership values allows for an enhanced representation of phenomena, especially when it comes to decision-making and identifying the most effective optimal solution. When modeling and resolving issues in unclear situations, a cubic fuzzy graph ( C F G ) is more flexible than fuzzy and intuitionistic fuzzy graphs. In this paper, the authors have introduced and proposed the maximal product of three cubic fuzzy graphs ( C F G s). The properties of three cubic fuzzy graphs were explored, and the real-world applications of the maximized network were analyzed by examining how interval-valued fuzzy membership and fuzzy membership, along with the assortment of relations, are simultaneously supported through the aspect of the degree and total degree of a vertex. We also discussed the domination parameter that is used to find the most effective and influential nodes in the weighted C F G network. In the future, this study will be extended to different types of operations with cubic fuzzy graphs in networking.

Author Contributions

Conceptualization, A.M. and O.M.; methodology, A.M. and O.M.; validation, A.M., O.M., R.Č. and K.K.; formal analysis, A.M., R.Č. and K.K.; investigation, A.M.; data curation, A.M.; writing—original draft preparation, O.M. and A.M.; writing—review and editing, R.Č., K.K. and O.M.; visualization, R.Č., K.K. and A.M.; supervision, A.M. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Data Availability Statement

The data will be made available by the authors on request.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Zadeh, L.A. Fuzzy sets. Inform. Control 1965, 8, 338–353. [Google Scholar] [CrossRef]
  2. Kaufmann, A. Introduction à la Théorie des Sous-Ensembles Flous à L’usage des Ingénieurs (Fuzzy Sets Theory); Masson: Paris, France, 1973; Volume 3. [Google Scholar]
  3. Rosenfeld, A. Fuzzy Graphs, Fuzzy Sets and Their Applications; Academic Press: New York, NY, USA, 1975; pp. 77–95. [Google Scholar]
  4. Talebi, A.A. Cayley fuzzy graphs on the fuzzy group. Comput. Appl. Math. 2018, 37, 4611–4632. [Google Scholar] [CrossRef]
  5. Borzooei, R.A.; Rashmanlou, H. New concepts of vague graphs. Int. J. Mach. Learn. Cybern. 2016, 8, 1081–1092. [Google Scholar] [CrossRef]
  6. Borzooei, R.A.; Rashmanlou, H.; Samanta, S.; Pal, M. Regularity of vague graphs. J. Intell. Fuzzy Syst. 2016, 30, 3681–3689. [Google Scholar] [CrossRef]
  7. Atanassov, K. Intuitionistic fuzzy sets. Fuzzy Sets Syst. 1986, 20, 87–96. [Google Scholar] [CrossRef]
  8. Akram, M.; Dudek, W.A. Interval-valued fuzzy graphs. Comput. Math. Appl. 2011, 61, 289–299. [Google Scholar] [CrossRef]
  9. Talebi, A.A.; Rashmanlou, H.; Sadati, S.H. New concepts on m-polar interval-valued intuitionistic fuzzy graph. TWMS J. Appl. Eng. Math. 2020, 10, 808–816. [Google Scholar]
  10. Talebi, A.A.; Rashmanlou, H.; Sadati, S.H. Interval-valued intuitionistic fuzzy competition graph. J. Mult.-Valued Log. Soft Comput. 2020, 34, 335–364. [Google Scholar]
  11. Kosari, S.; Rao, Y.; Jiang, H.; Liu, X.; Wu, P.; Shao, Z. Vague graph structure with application in medical diagnosis. Symmetry 2020, 12, 1582. [Google Scholar] [CrossRef]
  12. Rao, Y.; Kosari, S.; Shao, Z. Certain properties of vague graphs with a novel application. Mathematics 2020, 8, 1647. [Google Scholar] [CrossRef]
  13. Kou, Z.; Kosari, S.; Akhoundi, M. A novel description on vague graph with application in transportation systems. J. Math. 2021, 2021, 4800499. [Google Scholar] [CrossRef]
  14. Rao, Y.; Kosari, S.; Shao, Z.; Cai, R.; Liu, X. A study on domination in vague incidence graph and its application in medical sciences. Symmetry 2020, 12, 1885. [Google Scholar] [CrossRef]
  15. Rao, Y.; Kosari, S.; Shao, Z.; Qiang, X.; Akhoundi, M.; Zhang, X. Equitable domination in vague graphs with application in medical sciences. Front. Phys. 2021, 9, 635642. [Google Scholar] [CrossRef]
  16. Shi, X.; Kosari, S. Certain properties of domination in product vague graphs with novel application in medicine. Front. Phys. 2021, 9, 3–85. [Google Scholar] [CrossRef]
  17. Shao, Z.; Kosari, S.; Rashmanlou, H.; Shoaib, M. New concepts in intuitionistic fuzzy graph with application in water supplier systems. Mathematics 2020, 8, 1241. [Google Scholar] [CrossRef]
  18. Sampathkumar, E. Generalized graph structures. Bull. Kerala Math. Assoc. 2006, 3, 65–123. [Google Scholar]
  19. Dinesh, T.; Ramakrishnan, T. On generalised fuzzy graph structures. Appl. Math. Sci. 2011, 5, 173–180. [Google Scholar]
  20. Akram, M. m-Polar Fuzzy Graphs, Studies in Fuzziness and Soft Computing; Springer: Berlin/Heidelberg, Germany, 2019. [Google Scholar]
  21. Akram, M.; Akmal, R. Application of bipolar fuzzy sets in graph structures. Appl. Comput. Intell. Soft Comput. 2016, 2016, 5859080. [Google Scholar] [CrossRef]
  22. Akram, M.; Akmal, R. Intuitionistic fuzzy graph structures. Kragujev. J. Math. 2017, 41, 219–237. [Google Scholar] [CrossRef]
  23. Akram, M.; Akmal, R. Operations on intuitionistic fuzzy graph structures. Fuzzy Inform. Eng. 2016, 8, 389–410. [Google Scholar] [CrossRef]
  24. Akram, M.; Sitara, M.; Saeid, A.B. Residue product of fuzzy graph structures. J. Mult.-Valued Log. Soft Comput. 2020, 34, 365–399. [Google Scholar]
  25. Kou, Z.; Akhoundi, M.; Chen, X.; Omidi, S. A study on vague graph structures with an application. Adv. Math. Phys. 2022, 2022, 3182116. [Google Scholar] [CrossRef]
  26. Dinesh, T. Fuzzy incidence graph structures. Adv. Fuzzy Math. (AFM) 2020, 15, 21–30. [Google Scholar]
  27. Akram, M.; Sitara, M. Decision-making with q-rung orthopair fuzzy graph structures. Granul. Comput. 2021, 7, 505–526. [Google Scholar] [CrossRef]
  28. Sitara, M.; Zafar, F. Selection of best inter-country airline service using q-rung picture fuzzy graph structures. Comput. Appl. Math. 2022, 41, 54. [Google Scholar] [CrossRef]
  29. Jun, Y.B.; Kim, C.S.; Yang, K.O. Cubic sets. Ann. Fuzzy Math. Inform. 2012, 4, 83–98. [Google Scholar]
  30. Jun, Y.B.; Smarandache, F.; Kim, C.S. Neutrosophic cubic sets. New Math. Nat. Comput. 2017, 13, 41–54. [Google Scholar] [CrossRef]
  31. Jun, Y.B.; Song, S.Z.; Kim, S.J. Cubic interval-valued intuitionistic fuzzy sets and their application in BCK/BCI-algebras. Axioms 2018, 7, 7. [Google Scholar] [CrossRef]
  32. Jun, Y.B.; Lee, K.J.; Kang, M.S. Cubic structures applied to ideals of BCI-algebras. Comput. Math. Appl. 2011, 62, 3334–3342. [Google Scholar] [CrossRef]
  33. Khan, M.; Jun, Y.B.; Gulistan, M.; Yaqoob, N. The generalized version of Jun’s cubic sets in semigroups. J. Intell. Fuzzy Syst. 2015, 28, 947–960. [Google Scholar] [CrossRef]
  34. Ali, A.; Jun, Y.B.; Khan, M.; Shi, F.G.; Anis, S. Generalized cubic soft sets and their applications to algebraic structures. Ital. J. Pure Appl. Math. 2015, 35, 393–414. [Google Scholar]
  35. Senapati, T.; Jun, Y.B.; Muhiuddin, G.; Shum, K.P. Cubic intuitionistic structures applied to ideals of BCI-algebras. Analele Stiintifice Univ. Ovidius Constanta-Ser. Mat. 2019, 27, 213–232. [Google Scholar] [CrossRef]
  36. Muhiuddin, G.; Ahn, S.S.; Kim, C.S.; Jun, Y.B. Stable cubic sets. J. Comput. Anal. Appl. 2017, 23, 802–819. [Google Scholar]
  37. Krishna, K.K.; Rashmanlou, H.; Talebi, A.A.; Mofidnakhaei, F. Regularity of cubic graph with application. J. Indones. Math. Soc. 2019, 25, 1–15. [Google Scholar] [CrossRef]
  38. Rashid, S.; Yaqoob, N.; Akram, M.; Gulistan, M. Cubic graphs with application. Int. J. Anal. Appl. 2018, 16, 733–750. [Google Scholar]
  39. Muhiuddin, G.; Takallo, M.M.; Jun, Y.B.; Borzooei, R.A. Cubic graphs and their application to a traffic flow problem. Int. J. Comput. Intell. Syst. 2020, 13, 1265–1280. [Google Scholar] [CrossRef]
  40. Rashmanlou, H.; Muhiuddin, G.; Amanathulla, S.K.; Mofidnakhaei, F.; Pal, M. A study on cubic graphs with novel application. J. Intell. Fuzzy Syst. 2021, 40, 89–101. [Google Scholar] [CrossRef]
  41. Jiang, H.; Talebi, A.A.; Shao, Z.; Sadati, S.H.; Rashmanlou, H. New concepts of vertex covering in cubic graphs with its applications. Mathematics 2022, 10, 307. [Google Scholar] [CrossRef]
  42. Rao, Y.; Akhoundi, M.; Talebi, A.A.; Sadati, S.H. The Maximal Product in Cubic fuzzy graph structures with an application. Int. J. Comput. Intell. Syst. 2023, 16, 18. [Google Scholar] [CrossRef]
  43. Meenakshi, A.; Senbagamalar, J.; Kannan, A. Application of Intuitionistic fuzzy network using efficient domination. Fuzzy Log. Appl. Comput. Sci. Math. 2023, 213–232. [Google Scholar] [CrossRef]
  44. Meenakshi, A.; Senbagamalar, J. Equitable domination in neutrosophic graph using strong arc. Neutrosophic Sets Syst. 2023, 60, 59–73. [Google Scholar]
  45. Muhiuddin, G.; Talebi, A.A.; Sadati, S.H.; Rashmanlou, H. New concepts of domination in cubic graphs with application. J. Intell. Fuzzy Syst. 2022, 43, 841–857. [Google Scholar] [CrossRef]
  46. Meenakshi, A.; Mythreyi, O. Applications of Neutrosophic social network using max product networks. J. Intell. Fuzzy Syst. 2023, 45, 407–420. [Google Scholar] [CrossRef]
  47. Meenakshi, A.; Mythreyi, O.; Bramila, M.; Kannan, A.; Senbagamalar, J. Application of neutrosophic optimal network using operations. J. Intell. Fuzzy Syst. 2023, 45, 421–433. [Google Scholar] [CrossRef]
Figure 1. Graph G c .
Figure 1. Graph G c .
Mathematics 12 01605 g001
Figure 2. Graph G c .
Figure 2. Graph G c .
Mathematics 12 01605 g002
Figure 3. Graph G c .
Figure 3. Graph G c .
Mathematics 12 01605 g003
Figure 4. Vertex   membership   value   of   G c = G c M P G c M P G c .
Figure 4. Vertex   membership   value   of   G c = G c M P G c M P G c .
Mathematics 12 01605 g004
Figure 5. Edge   membership   value   of   G c = G c M P G c M P G c .
Figure 5. Edge   membership   value   of   G c = G c M P G c M P G c .
Mathematics 12 01605 g005
Figure 6. Network G c .
Figure 6. Network G c .
Mathematics 12 01605 g006
Figure 7. Network G c .
Figure 7. Network G c .
Mathematics 12 01605 g007
Figure 8. Network G c .
Figure 8. Network G c .
Mathematics 12 01605 g008
Figure 9. Maximized cubic fuzzy network G c .
Figure 9. Maximized cubic fuzzy network G c .
Mathematics 12 01605 g009
Figure 10. Weighted G c network.
Figure 10. Weighted G c network.
Mathematics 12 01605 g010
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Meenakshi, A.; Mythreyi, O.; Čep, R.; Karthik, K. A Study on Optimizing the Maximal Product in Cubic Fuzzy Graphs for Multifaceted Applications. Mathematics 2024, 12, 1605. https://doi.org/10.3390/math12101605

AMA Style

Meenakshi A, Mythreyi O, Čep R, Karthik K. A Study on Optimizing the Maximal Product in Cubic Fuzzy Graphs for Multifaceted Applications. Mathematics. 2024; 12(10):1605. https://doi.org/10.3390/math12101605

Chicago/Turabian Style

Meenakshi, Annamalai, Obel Mythreyi, Robert Čep, and Krishnasamy Karthik. 2024. "A Study on Optimizing the Maximal Product in Cubic Fuzzy Graphs for Multifaceted Applications" Mathematics 12, no. 10: 1605. https://doi.org/10.3390/math12101605

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop