# Computing First and Second Fuzzy Zagreb Indices of Linear and Multiacyclic Hydrocarbons

Authors: Zeeshan Saleem Mufti; Eiman Fatima; Rukhshanda Anjum; Fairouz Tchier; Qin Xin; Md. Moyazzem Hossain
Journal: Journal of Function Spaces
 (2022)

---

## Abstract

Fuzzy graph theory was invented by Rosenfeld. It is the extension of the work of L.A. Zadeh on fuzzy sets. Rosenfeld extracted the fuzzy-related concepts using the graph theoretic concepts. Topological indices for crisp theory have already been discussed in the literature but these days, topological index-related fuzzy graphs are much popular. Fuzzy graphs are being used as an application in different fields of sciences such as broadcast, communications, producing, social network, man-made reasoning, data hypothesis, and neural systems. In this paper, we have computed some fuzzy topological indices such as first and second Zagreb indices, Randic index, and harmonic index of fuzzy chemical graph named phenylene.


---

## Body

## 1. Introduction

Graph theory is a very ancient branch of discrete mathematics but miraculously applications of graph theory hit the modern world quite nicely. Nowadays, graph theory has roots in almost every field of science. The mathematical structures which are broadly used to represent relations between objects are based upon graphs. Graphs can conveniently express the structure for providing us information to employ and understand the behavior over the assumption tested on it [1–3, 9, 11].The graph is basically a well-defined setG=V,E of vertices V and edges E, where vertices are the points or dots and edges are the links connecting those points or nodes. The sets of vertices and edges are crisp sets in graph theory. But in fuzzy graph theory, the super set of a crisp set, namely, fuzzy set, deals with the notion of partial truth between absolute true and absolute false. Graph plays an important role in our life as it has widen its range to real-life applications. Most of the important fields like, networking, communication, data mining, clustering, image processing, image segmentation, planning, and scheduling rely on graphs. Graph theory represents real-life phenomena, but most of the times, graphs are not capable of properly representing many phenomena because vagueness of different imputes of the systems exists naturally. Many real-world facts are motivated to define the fuzzy graphs [6–8, 13, 26].Bhattacharya [4] elaborated the notion of the fuzzy group with fuzzy graphs. Bhutani [5] has focused on automorphism in fuzzy graphs. Gani and Latha [14] explained the concept of irregularity of fuzzy graphs. Gani and Ahamed [15] examined the degree and size of fuzzy graphs. Mathew and Sunitha [20] introduced the join, cartesian product, union, and composition of fuzzy subgraphs of graphs. Morderson and Peng [21] explained the basic applications of fuzzy graphs. Most popular applications regarding topological indices of fuzzy graphs are human trafficking and internet routing. The theory which usually defines the membership of an element in a set is called a set theory, which is appraise in binary terms in accordance with an associated condition if an element relates or does not relate to the set. By contrast, fuzzy set allows the progressive estimation of the membership of elements in a set; it can be evoked with the assistance of a membership function (a membership function (MF) is a curve which defines that how every point in the given space is mapped on a membership value (or degree of membership) between 0 and 1) valued in the real unit interval [0,1]. Fuzzy sets or uncertain sets are sets whose elements have a degree of membership. Simply, it is the generalization of the classical set. L.A. Zadeh in 1965 proposed one of the earliest uncertainty based models that assigns categorized memberships to elements rather than binary membership given by crisp sets. Through this soft computing technique, the ambiguity, vagueness, and uncertainty in real-world knowledge bases can be fixed [10, 12, 17, 19].Chemical graph theory is a topology branch of mathematical chemistry which deals with the combination of chemistry and graph theory in which graph theory is applied to mathematically model of chemical phenomena. Alexandru Balaban, Ante Graovac, Iván Gutman, Haruo Hosoya, Milan Randic, and Nenad Trinajsti´ c (also Harry´ Wiener and others) are the pioneers of chemical graph theory. In 1988, it was reported for producing about 500 articles annually and hundreds of researchers worked in chemical graph theory. By using tools of graph theory, this comprehensive science takes problems like isomer enumeration from chemistry, thus influencing both chemistry and mathematics. The chemical graph theory is a profound field for solving chemical problems by combining methods and theorems from mathematics and chemistry where molecular structures are usually represented as mathematical graphs. In such molecular graphs, vertices and edges represent atoms and bonds, respectively. To predict the chemical, physical, and biological activities, one may use some indices such as Wiener index which is one of the most famous examples of a graph-based molecular index. The applications of graph theory in chemistry include isomer enumeration and molecular structure generation [16, 22, 24]The numerical parameters of a graph which are usually graph invariants are called topological indices as they characterize its topology. Topological indices are used for example in the progress of (QSARs) Quantitative Structure-Activity Relationships. It describes the biological activity or other properties of molecules which are correlated with their chemical structure. Particular topological indices include the Zagreb index index, Randic index, and harmonic topological index. To correlate and predict several physical and chemical properties of chemical compounds especially carbon containing compounds, topological indices are used. A wide range of applications of the topological index of graph are in theoretical chemistry, network design, data transmission, etc. These topological indices have complete connotations in fuzzy graph. These topological indices are new in fuzzy graphs so we name them as modified topological indices. Here are some topological indices of fuzzy graphs which are first and second Zagreb indices, Randic index, and harmonic index.Fuzzy graphs are being used these days as an application tool in the field of mathematics because of its fuzziness which is very friendly in nature. Some basics of fuzzy graphs and notion related to these graphs are discussed here. What is actually a fuzzy graph? How it relates with topological indices? How can we find different topological indices of fuzzy graphs? A fuzzy graphG=V,σ,μ has a pair of functions σ and μ. σ maps the vertex set to the closed interval [0,1], and μ is mapping from the cartesian product of the vertex set with itself to the closed interval [0,1] such that it satisfies the following condition μp,q≤minσp,σq for all p,q∈V, and E is the set of collection of edges in G. The degree of vertex in fuzzy graphs can easily be calculated by taking the overall sum of all weights of edges, i.e., dp=Σμp,q. In crisp graph, the weight of all the edges is one by default but in fuzzy graph, the weight of every edge may vary from zero to one. The edges which contain fuzzy weights are called fuzzy edges. The order of the fuzzy graphs can be represented by the sum of the weights of all the vertices of a graph G, and the size of the fuzzy graphs can be found as the sum of all the weighs of its edges. By the definition of fuzzy graphs, the order of a fuzzy graphs is always greater than or equal to size of the fuzzy graphs [23, 25, 27]. Phenylene belongs to the special class of conjugated hydrocarbons which plays an important role in the field of chemistry. The graphical form of phenylene is a combination of two geometrical figures such as hexagon and square. These geometrical figures are joined in such a way that a square is adjusted between two hexagons.The motivation of this work came from [18]. We have generalized this work on chemical structure and compute the fuzzy topological indices of chemical structure mentioned in [18].


## 2. Topological Indices of Fuzzy Graph of Linear Phenylene

Topological index is a numeric value which describes the physicochemical properties of molecular structures.


### 2.1. Zagreb Index of First in Fuzzy Graphs

Kalathian et al. [18] introduced the fuzzy Zagreb index of first kind.
(1)MG=∑i=1nσuidui2.


### 2.2. Zagreb Index of Second Kind in Fuzzy Graphs

Kalathian et al. [18] introduced the fuzzy Zagreb index of second kind.
(2)M∗G=12∑ij∈EGσuiduiσvjdvj.


### 2.3. Randic Index in Fuzzy Graphs

Kalathian et al. [18] introduced the fuzzy Randic index.
(3)RG=12∑i=1nσuiduiσvjduj−1/2.


### 2.4. Harmonic Index in Fuzzy Graphs

Kalathian et al. [18] introduced the fuzzy harmonic index.
(4)HG=12∑ij∈EG1σuidui+σvjdvj.Theorem 1.
LetG be a fuzzy graph of linear phenylene; then, the first fuzzy Zagreb index of linear phenylene is MG=0.472n−0.116.Proof.
In linear phenylene structures (see Figures1 and 2), the total number of vertices is 6n and the total number of edges is 8n−2, respectively. The partition of the total vertex set with respect to weight has the following form by using Table 1: the vertex set V0.2 (0.2 is the weight of the vertex) has a total vertex count 2n out of which 2 vertices are of degree 0.3 and 2n−2 vertices are of degree 0.4, vertex set V0.3 (0.3 is the weight of the vertex) has a total vertex count 2n out of which n vertices are of degree 0.2 and n vertices are of degree 0.6, and vertex set V0.4 (0.4 is the weight of the vertex) has a total vertex count 2n out of which 2 vertices are of degree 0.5 and 2n−2 vertices are of degree 0.6.
(5)MG=∑i=1nσuidui2=0.220.32+2n−20.42+0.3n0.22+n0.62+0.420.52+2n−20.62=0.036+0.064n−0.064+0.012n+0.108n+0.2+0.288n−0.288=0.472n−0.116.Theorem 2.
LetG be a fuzzy graph of linear phenylene; then, the second fuzzy Zagreb index of linear phenylene is M∗G=0.0672n−0.0156.Proof.
The linear phenylene structures have a total number of vertices 6n and total number of edges 8n−2, respectively. The partition of the total edge sets has the following form by using Table 2: the edge set E1=u0.3,v0.4 (where 0.3 and 0.4 are the weights of the vertices u and v, respectively) has three type of partitions. The total count of the vertices of the type u0.3 is 2n out of which two vertices are of degree 0.6 and 2n−2 vertices are of degree 0.6, and the total count of the vertices of the type v0.4 is 2n out of which two vertices are of degree 0.5 and 2n−2 vertices are of degree 0.6. The edge set E2=u0.2,v0.3 (where 0.2 and 0.3 are the weights of the vertices u and v, respectively) has two types of partitions. The total count of the vertices of the type u0.2 is 2n out of which two vertices are of degree 0.3 and 2n−2 vertices of degree 0.4, and the total count of the vertices of the type v0.3 is 2n out of which two vertices are of degree 0.2 and 2n−2 vertices are of degree 0.2. The edge set E3=u0.2,v0.4 (where 0.2 and 0.4 are the weights of the vertices u and v, respectively) has two types of partitions. The total count of the vertices of the type u0.2 is 2n out of which two vertices are of degree 0.3 and 2n−2 vertices of degree 0.4, and the total count of the vertices of the type v0.4 is 2n out of which two vertices are of degree 0.5 and 2n−2 vertices are of degree 0.6.
(6)M∗G=12∑ij∈EGσuiduiσvjdvj=1220.30.60.40.5+2n−20.30.60.40.6+1220.20.30.30.2+2n−20.30.20.20.4+1220.20.30.40.5+2n−20.20.40.40.6=120.072+0.0864n−0.0864+0.0072+0.0096n−0.0096+0.024+0.0384n−0.0384=120.1344n−0.0312=0.0672n−0.0156.Theorem 3.
LetG be a fuzzy graph of linear phenylene; then, the Randic index of linear phenylene is RG=4.6039+26.462n.Proof.
The linear phenylene structures have a total number of vertices 6n and total number of edges 8n−2, respectively. The partition of the total edge sets has the following form by using Table 2: the edge set E1=u0.3,v0.4 (where 0.3 and 0.4 are the weights of the vertices u and v, respectively) has two types of partitions. The total count of the vertices of the type u0.3 is 2n out of which two vertices are of degree 0.6 and 2n−2 vertices are of degree 0.6, and the total count of the vertices of the type v0.4 is 2n out of which two vertices are of degree 0.5 and 2n−2 vertices are of degree 0.6. The edge set E2=u0.2,v0.3 (where 0.2 and 0.3 are the weights of the vertices u and v, respectively) has two types of partitions. The total count of the vertices of the type u0.2 is 2n out of which two vertices are of degree 0.3 and 2n−2 vertices of degree 0.4, and the total count of the vertices of the type v0.3 is 2n out of which two vertices of degree 0.2 and 2n−2 vertices are of degree 0.2. The edge set E3=u0.2,v0.4 (where 0.2 and 0.4 are the weights of the vertices u and v, respectively) has two types of partitions. The total count of the vertices of the type u0.2 is 2n out of which two vertices are of degree 0.3 and 2n−2 vertices are of degree 0.4, and the total count of the vertices of the type v0.4 is 2n out of which two vertices are of degree 0.5 and 2n−2 vertices are of degree 0.6.
(7)RG=12∑i=1nσuiduiσvjduj−1/2=1220.30.60.40.5−1/2+122n−20.30.60.40.6−1/2+1220.20.30.30.2−1/2+122n−20.30.20.20.4−1/2+1220.20.30.40.5−1/2+122n−20.20.40.40.6−1/2=5.2705+4.8113n−4.8113+16.6667+14.4338n−14.4338+9.1287+7.2169n−7.2169=4.6039+26.462n.Theorem 4.
LetG be a fuzzy graph of linear phenylene; then, the harmonic index for fuzzy graph of linear phenylene is HG=12.6488n+2.1624.Proof.
The linear phenylene structures have a total number of vertices 6n and total number of edges 8n−2, respectively. The partition of the total edge sets has the following form by using Table 2: the edge set E1=u0.3,v0.4 (where 0.3 and 0.4 are the weights of the vertices u and v, respectively) has two types of partitions. The total count of the vertices of the type u0.3 is 2n out of which two vertices are of degree 0.6 and 2n−2 vertices are of degree 0.6, and the total count of the vertices of the type v0.4 is 2n out of which two vertices are of degree 0.5 and 2n−2 vertices are of degree 0.6. The edge set E2=u0.2,v0.3 (where 0.2 and 0.3 are the weights of the vertices u and v, respectively) has two types of partitions. The total count of the vertices of the type u0.2 is 2n out of which two vertices are of degree 0.3 and 2n−2 vertices are of degree 0.4, and the total count of the vertices of the type v0.4 is 2n out of which two vertices are of degree 0.5 and 2n−2 vertices are of degree 0.6. The edge set E3=u0.2,v0.4 (where 0.2 and 0.4 are the weights of the vertices u and v, respectively) has two types of partitions. The total count of the vertices of the type u0.2 is 2n out of which two vertices are of degree 0.3 and 2n−2 vertices are of degree 0.4, and the total count of the vertices of the type v0.3 is 2n out of which two vertices are of degree 0.2 and 2n−2 vertices are of degree 0.2.
(8)HG=12∑ij∈EG1σuidui+σvjdvj=1220.3+0.6+0.40.5+122n−20.3+0.6+0.40.6+1220.2+0.3+0.30.2+122n−20.2+0.3+0.40.2+1220.2+0.3+0.40.5+122n−20.2+0.4+0.40.6=1220.38+2n−20.42+20.12+2n−20.14+20.26+2n−20.32=125.2632+4.7619n−4.7619+16.6667+14.2857n+14.2857+7.6923+6.25n−6.25=1225.2976n+4.3246=12.6488n+2.1623Figure 1
(1, 1) unit of fuzzy graph of phenylene.Figure 2
(1, 3) unit of fuzzy graph of phenylene.Table 1
Vertex count for fuzzy graph of linear phenylene.
Vertex w.r.t. vertex weightCount0.22n0.32n0.42nTable 2
Edge type according to the degrees for linear fuzzy graph.
Edge w.r.t vertex weightDegree typeCount(0.3,0.4)(0.6,0.5)2(0.3,0.4)(0.6,0.6)(2n‐2)(0.2,0.3)(0.3,0.2)(2)(0.3,0.2)(0.2,0.4)(2n‐2)(0.2,0.4)(0.3,0.5)(2)(0.2,0.4)(0.4,0.6)(2n‐2)


## 2.1. Zagreb Index of First in Fuzzy Graphs

Kalathian et al. [18] introduced the fuzzy Zagreb index of first kind.
(1)MG=∑i=1nσuidui2.


## 2.2. Zagreb Index of Second Kind in Fuzzy Graphs

Kalathian et al. [18] introduced the fuzzy Zagreb index of second kind.
(2)M∗G=12∑ij∈EGσuiduiσvjdvj.


## 2.3. Randic Index in Fuzzy Graphs

Kalathian et al. [18] introduced the fuzzy Randic index.
(3)RG=12∑i=1nσuiduiσvjduj−1/2.


## 2.4. Harmonic Index in Fuzzy Graphs

Kalathian et al. [18] introduced the fuzzy harmonic index.
(4)HG=12∑ij∈EG1σuidui+σvjdvj.Theorem 1.
LetG be a fuzzy graph of linear phenylene; then, the first fuzzy Zagreb index of linear phenylene is MG=0.472n−0.116.Proof.
In linear phenylene structures (see Figures1 and 2), the total number of vertices is 6n and the total number of edges is 8n−2, respectively. The partition of the total vertex set with respect to weight has the following form by using Table 1: the vertex set V0.2 (0.2 is the weight of the vertex) has a total vertex count 2n out of which 2 vertices are of degree 0.3 and 2n−2 vertices are of degree 0.4, vertex set V0.3 (0.3 is the weight of the vertex) has a total vertex count 2n out of which n vertices are of degree 0.2 and n vertices are of degree 0.6, and vertex set V0.4 (0.4 is the weight of the vertex) has a total vertex count 2n out of which 2 vertices are of degree 0.5 and 2n−2 vertices are of degree 0.6.
(5)MG=∑i=1nσuidui2=0.220.32+2n−20.42+0.3n0.22+n0.62+0.420.52+2n−20.62=0.036+0.064n−0.064+0.012n+0.108n+0.2+0.288n−0.288=0.472n−0.116.Theorem 2.
LetG be a fuzzy graph of linear phenylene; then, the second fuzzy Zagreb index of linear phenylene is M∗G=0.0672n−0.0156.Proof.
The linear phenylene structures have a total number of vertices 6n and total number of edges 8n−2, respectively. The partition of the total edge sets has the following form by using Table 2: the edge set E1=u0.3,v0.4 (where 0.3 and 0.4 are the weights of the vertices u and v, respectively) has three type of partitions. The total count of the vertices of the type u0.3 is 2n out of which two vertices are of degree 0.6 and 2n−2 vertices are of degree 0.6, and the total count of the vertices of the type v0.4 is 2n out of which two vertices are of degree 0.5 and 2n−2 vertices are of degree 0.6. The edge set E2=u0.2,v0.3 (where 0.2 and 0.3 are the weights of the vertices u and v, respectively) has two types of partitions. The total count of the vertices of the type u0.2 is 2n out of which two vertices are of degree 0.3 and 2n−2 vertices of degree 0.4, and the total count of the vertices of the type v0.3 is 2n out of which two vertices are of degree 0.2 and 2n−2 vertices are of degree 0.2. The edge set E3=u0.2,v0.4 (where 0.2 and 0.4 are the weights of the vertices u and v, respectively) has two types of partitions. The total count of the vertices of the type u0.2 is 2n out of which two vertices are of degree 0.3 and 2n−2 vertices of degree 0.4, and the total count of the vertices of the type v0.4 is 2n out of which two vertices are of degree 0.5 and 2n−2 vertices are of degree 0.6.
(6)M∗G=12∑ij∈EGσuiduiσvjdvj=1220.30.60.40.5+2n−20.30.60.40.6+1220.20.30.30.2+2n−20.30.20.20.4+1220.20.30.40.5+2n−20.20.40.40.6=120.072+0.0864n−0.0864+0.0072+0.0096n−0.0096+0.024+0.0384n−0.0384=120.1344n−0.0312=0.0672n−0.0156.Theorem 3.
LetG be a fuzzy graph of linear phenylene; then, the Randic index of linear phenylene is RG=4.6039+26.462n.Proof.
The linear phenylene structures have a total number of vertices 6n and total number of edges 8n−2, respectively. The partition of the total edge sets has the following form by using Table 2: the edge set E1=u0.3,v0.4 (where 0.3 and 0.4 are the weights of the vertices u and v, respectively) has two types of partitions. The total count of the vertices of the type u0.3 is 2n out of which two vertices are of degree 0.6 and 2n−2 vertices are of degree 0.6, and the total count of the vertices of the type v0.4 is 2n out of which two vertices are of degree 0.5 and 2n−2 vertices are of degree 0.6. The edge set E2=u0.2,v0.3 (where 0.2 and 0.3 are the weights of the vertices u and v, respectively) has two types of partitions. The total count of the vertices of the type u0.2 is 2n out of which two vertices are of degree 0.3 and 2n−2 vertices of degree 0.4, and the total count of the vertices of the type v0.3 is 2n out of which two vertices of degree 0.2 and 2n−2 vertices are of degree 0.2. The edge set E3=u0.2,v0.4 (where 0.2 and 0.4 are the weights of the vertices u and v, respectively) has two types of partitions. The total count of the vertices of the type u0.2 is 2n out of which two vertices are of degree 0.3 and 2n−2 vertices are of degree 0.4, and the total count of the vertices of the type v0.4 is 2n out of which two vertices are of degree 0.5 and 2n−2 vertices are of degree 0.6.
(7)RG=12∑i=1nσuiduiσvjduj−1/2=1220.30.60.40.5−1/2+122n−20.30.60.40.6−1/2+1220.20.30.30.2−1/2+122n−20.30.20.20.4−1/2+1220.20.30.40.5−1/2+122n−20.20.40.40.6−1/2=5.2705+4.8113n−4.8113+16.6667+14.4338n−14.4338+9.1287+7.2169n−7.2169=4.6039+26.462n.Theorem 4.
LetG be a fuzzy graph of linear phenylene; then, the harmonic index for fuzzy graph of linear phenylene is HG=12.6488n+2.1624.Proof.
The linear phenylene structures have a total number of vertices 6n and total number of edges 8n−2, respectively. The partition of the total edge sets has the following form by using Table 2: the edge set E1=u0.3,v0.4 (where 0.3 and 0.4 are the weights of the vertices u and v, respectively) has two types of partitions. The total count of the vertices of the type u0.3 is 2n out of which two vertices are of degree 0.6 and 2n−2 vertices are of degree 0.6, and the total count of the vertices of the type v0.4 is 2n out of which two vertices are of degree 0.5 and 2n−2 vertices are of degree 0.6. The edge set E2=u0.2,v0.3 (where 0.2 and 0.3 are the weights of the vertices u and v, respectively) has two types of partitions. The total count of the vertices of the type u0.2 is 2n out of which two vertices are of degree 0.3 and 2n−2 vertices are of degree 0.4, and the total count of the vertices of the type v0.4 is 2n out of which two vertices are of degree 0.5 and 2n−2 vertices are of degree 0.6. The edge set E3=u0.2,v0.4 (where 0.2 and 0.4 are the weights of the vertices u and v, respectively) has two types of partitions. The total count of the vertices of the type u0.2 is 2n out of which two vertices are of degree 0.3 and 2n−2 vertices are of degree 0.4, and the total count of the vertices of the type v0.3 is 2n out of which two vertices are of degree 0.2 and 2n−2 vertices are of degree 0.2.
(8)HG=12∑ij∈EG1σuidui+σvjdvj=1220.3+0.6+0.40.5+122n−20.3+0.6+0.40.6+1220.2+0.3+0.30.2+122n−20.2+0.3+0.40.2+1220.2+0.3+0.40.5+122n−20.2+0.4+0.40.6=1220.38+2n−20.42+20.12+2n−20.14+20.26+2n−20.32=125.2632+4.7619n−4.7619+16.6667+14.2857n+14.2857+7.6923+6.25n−6.25=1225.2976n+4.3246=12.6488n+2.1623Figure 1
(1, 1) unit of fuzzy graph of phenylene.Figure 2
(1, 3) unit of fuzzy graph of phenylene.Table 1
Vertex count for fuzzy graph of linear phenylene.
Vertex w.r.t. vertex weightCount0.22n0.32n0.42nTable 2
Edge type according to the degrees for linear fuzzy graph.
Edge w.r.t vertex weightDegree typeCount(0.3,0.4)(0.6,0.5)2(0.3,0.4)(0.6,0.6)(2n‐2)(0.2,0.3)(0.3,0.2)(2)(0.3,0.2)(0.2,0.4)(2n‐2)(0.2,0.4)(0.3,0.5)(2)(0.2,0.4)(0.4,0.6)(2n‐2)


## 3. Topological Indices of Fuzzy Graph of Multiphenylene

Theorem 5.
LetG be a fuzzy graph of multiphenylene; then, the first fuzzy Zagreb index of multiphenylene is MG=0.592mn−0.116m−0.12n.Proof.
In multiphenylene structures (see Figure3), the total number of vertices is 6mn and the total number of edges is 8n−2, respectively. The partition of the total vertex set with respect to weight has the following form by using Table 3: the vertex set V0.2 (0.2 is the weight of the vertex) has a total vertex count 2mn out of which 2m vertex is of degree 0.3 and 2mn−2m vertices are of degree 0.4, vertex set V0.3 (0.3 is the weight of the vertex) has a total vertex count 2mn out of which n vertices are of degree 0.2, n vertices are of degree 0.6, mn−n vertices of are degree 0.4, and mn−n vertices are of degree 0.8, and vertex set V0.4 (0.4 is the weight of the vertex) has a total vertex count 2mn out of which 2m vertex is of degree 0.5 and 2mn−2m vertices are of degree 0.6.
(9)MG=∑i=1nσuidui2=0.22m0.32+2mn−2m0.42+0.3n0.22+mn−n0.42+0.3n0.62+mn−n0.82+0.42m0.52+2mn−2m0.62=0.036m+0.064mn−0.064m+0.012n+0.048mn−0.048n+0.108n+0.192mn−0.192n+0.2m+0.288mm−0.288m=0.592mn−0.116m−0.12n.Theorem 6.
LetG be a fuzzy graph of multiphenylene; then, the second fuzzy Zagreb index of multiphenylene is M∗G=0.14mn−0.0584m−0.0408n+0.0108.Proof.
The multiphenylene structures have a total number of vertices 6mn and total number of edges 8n−2, respectively. The partition of the total edge sets has the following form by using Table 4: the edge set E1=u0.3,v0.4 (where 0.3 and 0.4 are the weights of the vertices u and v, respectively) has four types of partitions. The total count of the vertices of the type u0.3 is 2mn out of which 2 vertices are of degree 0.6, 2n−2 vertices are of degree 0.6, 2m−2 vertices are of degree 0.8, and 2mn−2m−2n+2 vertices are of degree 0.8, and similarly, the total count of the vertices of the type v0.4 is 2mn out of which 2 vertices are of degree 0.5, 2n−2 vertices are of degree 0.6, 2m−2 vertices are of degree 0.5, and 2mn−2m−2n+2 vertices are of degree 0.6. The edge set E2=u0.2,v0.2 (where 0.2 and 0.2 are the weights of the vertices u and v, respectively) has one type of partition. The total count of the vertices of the type u0.2 is 2mn out of which mn−m vertices are of degree 0.4 and mn−m vertices are of degree 0.4. The edge set E3=u0.4,v0.4 (where 0.4 and 0.4 are the weights of the vertices u and v, respectively) has one type of partition. The total count of the vertices of the type u0.4 is 2mn out of which mn−m vertices are of degree 0.6 and mn−m vertices are of degree 0.6.
The edge setE4=u0.2,v0.4 (where 0.2 and 0.4 are the weights of the vertices u and v, respectively) has two types of partitions. The total count of the vertices of the type u0.2 is 2mn out of which 2m vertices are of degree 0.3 and 2mn−2m vertices are of degree 0.4, and the total count of the vertices of the type v0.4 is 2mn out of which 2m vertices are of degree 0.5 and 2mn−2m vertices are of degree 0.6. The edge set E5=u0.2,v0.3 (where 0.2 and 0.3 are the weights of the vertices u and v, respectively) has four types of partitions. The total count of the vertices of the type u0.2 is 2mn out of which 2 vertices are of degree 0.3, 2n−2 vertices are of degree 0.4, 2mn−2n vertices are of degree 0.3, and 2mn−2m−2n+2 vertices are of degree 0.4, and similarly, the total count of the vertices of the type v0.3 is 2mn out of which 2 vertices are of degree 0.2, 2n−2 vertices are of degree 0.2, 2mn−2n vertices are of degree 0.4, and 2mn−2m−2n+2 vertices are of degree 0.4. The edge set E6=u0.3,v0.3 (where 0.3 and 0.3 are the weights of the vertices u and v, respectively) has one type of partition. The total count of the vertices of the type u0.3 is 2mn out of which mn−n vertices are of degree 0.4 and mn−n vertices are of degree 0.8.
(10)M∗G=12∑ij∈EGσuiduiσvjdvj=1220.30.60.40.5+2n−20.30.60.40.6+12mn−m0.40.20.20.4+2mn−2m−2n+20.40.30.80.6+12mn−m0.40.60.40.6+2m−20.40.30.80.5+122m0.20.30.40.5+2mn−2m0.20.40.40.6+1220.20.30.30.2+2n−20.20.40.30.2+122mn−2n0.20.30.30.4+2mn−2m−2n+20.20.40.30.4+12mn−n0.30.40.30.8=120.072+0.0864n−0.0864+0.096m−0.096+0.1152mn−0.1152m−0.1152n+0.1152+0.0064mn−0.0064m+0.0576mn−0.0576m+0.024m+0.0384mn−0.384m+0.0072+0.0096n−0.0096+0.0144mn−0.0144n+0.0192mn−0.0192m−0.0192n+0.0192+0.0288mn−0.0288n=120.28mn−0.1168m−0.0816n+0.0216=0.14mn−0.0584m−0.0408n+0.0108.Theorem 7.
LetG be a fuzzy graph of multiphenylene; then, the Randic index of multiphenylene is RG=44.6542mn−16.2297m−9.8592n+9.5543.Proof.
(11)RG=12∑i=1nσuiduiσvjduj−1/2=120.30.60.40.5−1/2+122n−20.30.60.40.6−1/2+12mn−m0.40.20.20.4−1/2+122mn−2m−2n+20.40.30.80.6−1/2+12mn−m0.40.60.40.6−1/2+122m−20.40.30.80.5−1/2+122m0.20.30.40.5−1/2+122mn−2m0.20.40.40.6−1/2+1220.20.30.30.2−1/2+122n−20.20.40.30.2−1/2+122mn−2n0.20.30.30.4−1/2+122mn−2m−2n+20.20.40.30.4−1/2+12mn−n0.30.40.30.8−1/2=125.2705+4.8113n−48113+6.25mn−6.25m+4.1667mn−4.1667m−4.1667n+4.1667+2.083mn−2.083m+4.5644m−4.5644+9.1287m+7.2169mn−7.2169m+16.6667+14.4338n−14.4338+11.7851mn−11.7851n+10.2062mn−10.2062m−10.2062n+10.2062+2.9463mn−2.9463n=44.6542mn−16.2297m−9.8592n+9.5543.Theorem 8.
LetG be a fuzzy graph of multiphenylene; then, the harmonic index for fuzzy graph of multiphenylene is HG=21.3195mn−5.1311m−7.629n+6.2518.Proof.
(12)HG=12∑ij∈EG1σuidui+σvjdvj=1220.30.6+0.40.5+122n−20.30.6+0.40.6+122m−20.80.3+0.40.5+122mn−2m−2n+20.80.3+0.40.6+12mn−m0.20.4+0.40.2+12mn−m0.60.4+0.40.6+122m0.20.3+0.40.5+122mn−2m0.20.4+0.40.6+1220.20.3+0.20.3+122n−20.20.4+0.20.3+122mn−2n0.20.3+0.40.3+122mn−2m−2n+20.20.4+0.40.3+12mn−n0.30.4+0.80.3=1220.38+2n−20.42+2m−20.44+2mn−2m−2n+20.48+mn−m0.16+mn−m0.48+122m0.26+2mn−2m0.32+20.12+2n−20.14+2mn−2n0.18+2mn−2m−2n+20.2+mn−n0.36=125.2632+4.7619n−4.7619+4.5455m−4.5455+4.1667mn−4.1667m+12−4.1667n+4.1667+6.25mn−6.25m+2.0833mn−2.0833m+7.6923m+6.25mn−6.25m+16+1211.1111mn−11.1111n+10mn−10m−10n+10+2.7778mn−2.7778n=1242.6389mn−10.2622m−15.258n+12.5035.Figure 3
(2, 2) unit of fuzzy graph of phenylene.Table 3
Vertex count for general fuzzy graph.
VertexTypeCount0.20.3, 0.42m, 2mn‐2m0.30.2, 0.4, 0.6, 0.8n, mn‐n, n, mnn0.40.5, 0.62m, 2mn‐2mTable 4
Edge type according to the degrees for general fuzzy graph.
EdgeDegree typeCount(0.3,0.4)(0.6,0.5)2(0.3,0.4)(0.6,0.6)(2n‐2)(0.3,0.4)(0.8,0.5)(2m‐2)(0.3,0.4)(0.8,0.6)(2mn‐2m‐2n+2)(0.2,0.2)(0.4,0.4)(mn‐m)(0.4,0.4)(0.6,0.6)(mn‐m)(0.2,0.4)(0.3,0.5)(2m)(0.2,0.4)(0.4,0.6)(2mn‐2m)(0.2,0.3)(0.3,0.2)(2)(0.2,0.3)(0.4,0.2)(2n‐2)(0.2,0.3)(0.3,0.4)(2mn‐2n)(0.2,0.3)(0.4,0.4)(2mn‐2m‐2n+2)(0.3,0.3)(0.4,0.8)(mn‐n)


## 4. Conclusion

In this paper, we find some topological indices of fuzzy chemical graph based on vertex-degree such as Zagreb first and second kind, Randic, and harmonic indices. The applications of fuzzy graphs are getting attraction due to its implementation in various fields of sciences such as medication, determination and treatment of sickness, and in telecommunication framework. Similarly, most popular applications regarding topological indices of fuzzy graphs are human trafficking and internet routing. We studied fuzzy graph of phenylene structure theocratically, not experimentally. Our results on fuzzy graph of phenylene can be very beneficial and helpful for the mankind to understand the physical properties, chemical reactivity, and biological activity. In future, we are focusing on the line graph of abovementioned structures.



---

*Source: 6281592-2022-03-22.xml*