
==== Front
Heliyon
Heliyon
Heliyon
2405-8440
Elsevier

S2405-8440(24)12141-X
10.1016/j.heliyon.2024.e36110
e36110
Research Article
Hyper-Zagreb index in fuzzy environment and its application
Islam Sk Rabiul islamskrabiul61@gmail.com
ab
Mohsin Bandar Bin balmohsen@ksu.edu.sa
c
Pal Madhumangal mmpalvu@mail.vidyasagar.ac.in
bd⁎
a Department of Mathematics, Brainware University, 398, Ramkrishnapur Road, Jagadighata Market, Barasat, Kolkata-700125, India
b Department of Applied Mathematics, Vidyasagar University, Midnapore 721102, India
c Department of Mathematics, College of Science, King Saud University, P.O. Box 2455, Riyadh 11451, Saudi Arabia
d Department of Mathematics and Innovation, Saveetha School of Engineering, Chennai 602105, Tamilnadu, India
⁎ Corresponding author at: Department of Applied Mathematics, Vidyasagar University, Midnapore 721102, India. mmpalvu@mail.vidyasagar.ac.in
15 8 2024
30 8 2024
15 8 2024
10 16 e3611014 5 2024
7 8 2024
9 8 2024
© 2024 The Author(s)
2024
https://creativecommons.org/licenses/by/4.0/ This is an open access article under the CC BY license (http://creativecommons.org/licenses/by/4.0/).
The Zagreb indices (ZIs) are important graph invariants that are used extensively in many different fields in mathematics and chemistry, such as network theory, spectral graph theory, fuzzy graph theory (FGT) and molecular chemistry, etc. The hyper-ZI is introduced especially for fuzzy graphs (FGs) in this study. The study computes this index's bounds for a variety of FG types, including paths, cycles, stars, complete FGs and partial fuzzy subgraphs. It is shown that isomorphic FGs produce the same values for this index. Moreover, interesting connections are established between the hyper-ZI and the second ZI for FGs. Moreover, bounds on this index are found for the following operations: direct product, Cartesian product, composition, join, union, strong product and semi-strong product of two FGs. In the end, the effectiveness of this index is compared with three other topological indices: hyper-ZI for crisp graphs, first ZI for FGs and F-index for FGs, in an analysis of the crime “Murder” in India. While the hyper-ZI for FGs, first ZI for FGs and F-index for FGs yield similar outcomes, the hyper-ZI for FGs demonstrates superior realism in detecting crimes in India compared to its crisp graph counterpart.

MSC

05C09
05C72
Keywords

Fuzzy graph
Topological indices
First Zagreb index
Second Zagreb index
Hyper-Zagreb index
==== Body
pmc1 Introduction

1.1 Research background

Fuzzy graph theory marks a notable departure from traditional graph theory by incorporating the notion of fuzziness into graph structures, thus allowing for the representation of imprecise and uncertain information. The seminal work of Zadeh [60] (1965) established the groundwork for fuzzy sets, which introduced the revolutionary concept of degrees of membership. This innovation enabled the modeling of uncertainty and vagueness within mathematical frameworks. Lee et al. [27] present a comprehensive comparison of different types of fuzzy sets, specifically interval-valued fuzzy sets, intuitionistic fuzzy sets, bipolar fuzzy sets, etc. Building upon this foundation, Rosenfeld [48] (1975) further extended the application of fuzzy sets to graph theory, thereby introducing fuzzy graphs (FGs) as a generalization of classical graphs. FG theory has emerged as a powerful tool for modeling imprecise and uncertain information in various real-world applications. Many applications of FGs are described in [29], [40], [50].

Ananthanarayanan and Lavanya [3] introduced the concept of FG coloring, demonstrating how α-cuts can be used for this purpose. Rosyida et al. [49] proposed an innovative approach to evaluate the fuzzy chromatic number of a FG, contributing to the understanding of graph coloring in uncertain environments. Bhutani and Rosenfeld conducted a series of studies, including investigations into strong arcs [4], fuzzy end nodes [5], M-strong FGs [6] and geodesies [7]. These works expanded the understanding of connectivity and paths within FGs. Sunitha and Vijayakumar investigated the complement of FGs [57]. Their contributions enriched the field's understanding of graph properties and structures. Tajdin et al. [58] addressed the computation of fuzzy shortest paths using α-cuts, demonstrating practical applications of FGs in network analysis and optimization. Nagoorgani et al. [36] introduced the idea of fuzzy effective distance k-dominating sets, laying the foundation for understanding dominance in FGs. Sahoo and Pal [54] explored intuitionistic competition FGs, adding a competitive aspect to the fuzzy framework. They further extended their study to intuitionistic tolerance FGs [55]. Samanta and Pal [56] introduced k-competition FGs, respectively, providing a comprehensive exploration of the structural aspects of these FG variations. Akram's seminal work [1] studied the concept of bipolar FGs, where each edge and vertex are associated with both positive and negative membership degrees. Rashmanlou et al. [46] investigated the product of bipolar FGs and their degrees, contributing to a deeper understanding of graph operations within the bipolar fuzzy context. Interval-valued FGs were investigated by Akram and Dudek [2] and further extended to interval-valued threshold FGs [41], interval-valued phi-tolerance competition FGs [42] and interval-valued planar FGs [43], shedding light on the implications of interval-valued fuzziness. Mondal et al. [33] explored the utilization of the isometric and antipodal concepts within m-polar FGs. Their study delves into the application of these concepts in solving a road network problem, showcasing the effectiveness of this approach. Furthermore, the authors investigated the idea of a generalized m-polar planar FG and its practical application [34], as well as the utilization of Interval-valued intuitionistic soft FGs in real-world scenarios [35]. Many works have been done on FGs and related graphs such as covering and pair domination in intuitionistic fuzzy graphs [53], isomorphism of m-polar fuzzy graphs [12], cubic graph [47], completeness and regularity of FS [52], edge coloring of FGs [30], product bipolar FGs [13], etc.

In 1947, Harold Wiener [59] first introduced the Wiener index and it is used to determine the boiling point of paraffin. In 1971, Hosoya [17] introduced the Hosoya index. Followed by those indices Gutman et al. studied some another TIs: ZIs [14], Szeged index [15], Gutman index [16], F-index [11], etc. Randic introduced the Randic index (connectivity index) [44] and hyper-Wiener index [45]. One can read other TIs: PI index [26], AM-GM index [51], etc. Some degree-based [31] and neighborhood degree-based [32] topological index is studied by Mondal et al. One can also study other topological index in [24] like: Harary index, General Zagreb index, Zagreb coindices, multiplicative version of Zagreb indices, general Randic index, Randic co-index, ABC index, Harmonic index, Geometric-arithmetic index, sum connectivity index, augmented Zagreb index, etc.

1.2 Motivation

Many results and applications are available for TIs in crisp graphs. Some circumstances cannot be handled using crisp graphs in many real-life problems. In such cases, to handle the problem, those TIs are needed to introduce in FGs. In 2020, Binu, Mathew and Mordeson [9] first defined a topological index “Wiener index” in a FGs. Connectivity index (CI) and average CI for a FG are also proposed by Binu, Mathew and Mordeson [8]. Also, Islam and Pal have been introduced and studied some TIs for FG: First Zagreb index [18], Hyper-Wiener index [19], F-index [20], Hyper-connectivity index [21], Second Zagreb index [22], Multiplicative first ZI [23], etc. Kalathian et al. [25] discussed so many TIs for FGs also. Fang et al. [10] studied connectivity and Wiener index for fuzzy incidence graph. Mufti et al. studied first and second fuzzy ZI [37]. Liaqat et al. [28] Naeem et al. [38] studied connectivity index for intuitionistic FG. Cyclic connectivity index for fuzzy incidence graph [39] is studied by Nazeer et al. Motivated by these articles, in this paper, the hyper-ZI is introduced and studied for FGs.

1.3 Novelty of the article

Topological indices (TIs) play a critical role in chemical graph theory, spectral graph theory, network theory, molecular chemistry, FG theory and various other domains. Among these indices, ZIs are particularly noteworthy as degree-based TIs, initially introduced by Gutman and Trinajstic in 1972. ZIs are instrumental in calculating the π-electron energy of conjugate systems, rendering them invaluable in network theory, spectral graph theory, molecular chemistry and numerous fields within chemistry and mathematics.

(i) In this study, the hyper-ZI is defined and examined for FGs.

(ii) The article presents the calculated bounds of this index for several types of FGs, including paths, cycles, stars, complete FGs and partial fuzzy subgraphs.

(iii) Notably, it is demonstrated that for isomorphic FGs, the value of this index remains constant.

(iv) Moreover, an intriguing relationship between the second ZI and the hyper-ZI for FGs is elucidated.

(v) The study further establishes bounds for this index in operations involving Cartesian product, composition, join, union, direct product, strong product and semi-strong product of two FGs.

(vi) Additionally, the article concludes with an analysis of the crime “Murder” in India using this index, providing insights into its application in real-world scenarios.

1.4 Framework of the article

The article's structure: Section 2 provides some basic definitions. In section 3, hyper-ZI has been defined and provided some bounds for several FGs: path, cycle, star, partial fuzzy subgraph, complete FG, isomorphic FGs, etc. Also, some exciting relations have been established between the second-ZI and hyper-ZI for a FG. Bounds of this index for the Cartesian product, composition, join, union, direct product, strong product and semi-strong product of two FGs have been established in section 4. In section 5, the crime “Murder” in states of India has been analyzed by this index.

2 Preliminaries

In 1975, Rosenfeld introduced the concept of FG. The FG is defined as:

Definition 2.1 [23], [40] A FG is a pair, G=(V,E), where V is called vertex set of the FG with vertex membership function ξ:V→[0,1] and E is called edge set with edge membership function η:V×V→[0,1] satisfying η(x,y)≤min⁡{ξ(x),ξ(y)}.

Definition 2.2 [40] Degree of a vertex v is denoted by dG(v) or simply d(v) and defined as d(v)=∑x∈Vη(xv).

Here, maximum degree of G is denoted by Δ(G) or Δ and is defined as Δ=∨v∈Vd(v). Also, minimum degree of G is denoted by δ(G) or δ and is defined as δ=∧v∈Vd(v). The total degree of G is sum of the degrees of all vertices and denoted by T(G) or simply T.

Throughout this article, the FG, G1=(V1,E1) has n1-vertices, m1-edges and G2=(V2,E2) has n2-vertices, m2-edges and Δ1=Δ(G1),Δ2=Δ(G2),δ1=δ(G1),δ2=δ(G2).

Now, Cartesian product, composition, join, union, direct product, strong product and semi-strong product of two FGs are defined below: Definition 2.3 [40] The Cartesian product of G1 and G2 is a FG G1×G2=(V,E), where V=V1×V2, (u,v),(u1,v1),(u2,v2)∈V,ξ(u,v)=∧{ξ1(u),ξ2(v)} andη((u1,v1),(u2,v2))={∧{ξ1(u1),η2(v1,v2)} if u1=u2,v1v2∈E2∧{ξ2(v1),η1(u1,u2)} if u1u2∈E1,v1=v20 otherwise.

Definition 2.4 [40] Let G1=(V1,E1),G2=(V2,E2) be two FGs. Then the composition of G1 and G2 is a FG G1[G2]=(V,E), where V=V1×V2, (u,v),(u1,v1), (u2,v2)∈V,ξ(u,v)=∧{ξ1(u),ξ2(v)} andη((u1,v1),(u2,v2))={∧{ξ1(u1),η2(v1,v2)} if u1=u2 and v1v2∈E2∧{ξ2(v1),ξ2(v2),η1(u1,u2)} if u1u2∈E10 otherwise.

Definition 2.5 [40] Let G1=(V1,E1),G2=(V2,E2) be two FGs. Then the join of G1 and G2 is a FG G1+G2=(V,E), where V=V1∪V2, u,v,u1,v1∈V,ξ(u)={ξ1(u), if u∈V1ξ2(u), if u∈V2

andη(u,v)={∧{ξ1(u),ξ2(v)} if u∈V1 and v∈V2η1(u,v) if uv∈E1η2(u,v) if uv∈E20 otherwise.

Definition 2.6 [40] Let G1=(V1,E1),G2=(V2,E2) be two FGs. Then the union of G1 and G2 is a FG G1∪G2=(V,E), where V=V1∪V2, u,v∈V,ξ(u)={ξ1(u), if u∈V1∖V2ξ2(u), if u∈V2∖V1∨{ξ1(u),ξ2(u)}, if u∈V1∩V2

andη(u,v)={η1(u,v) if uv∈E1∖E2η2(u,v) if uv∈E2∖E1∨{ξ1(u,v),ξ2(u,v)} if (u,v)∈E1∩E20 otherwise.

Definition 2.7 [40] Let G1=(V1,E1),G2=(V2,E2) be two FGs. Suppose, V1∩V2=ϕ, then the direct product of G1 and G2 is a FG G1∏G2=(V,E), where V=V1×V2, E={((u1,v1)(u2,v2)):u1u2∈E1 and v1v2∈E2}, ξ(u,v)=ξ1(u)∧ξ2(v) and η((u1,v1)(u2,v2))=η1(u1u2)∧η2(v1v2).

Definition 2.8 [40] Let G1=(V1,E1),G2=(V2,E2) be two FGs. Suppose, V1∩V2=ϕ, then the semi-strong product of G1 and G2 is a FG G1•G2=(V,E), where V=V1×V2, E={((u1,v1)(u2,v2)):u1u2∈E1 and v1v2∈E2}∪{((u,v1)(u,v2)):u∈V1,v1v2∈E2}, ξ(u,v)=ξ1(u)∧ξ2(v) andη((u1,v1)(u2,v2))={η1(u1u2)∧η2(v1v2) if u1u2∈E1 and v1v2∈E2ξ1(u)∧η2(v1v2) if u1=u2=u∈V1 and v1v2∈E2

Definition 2.9 [40] Let G1=(V1,E1),G2=(V2,E2) be two FGs. Suppose, V1∩V2=ϕ, then the strong product of G1 and G2 is a FG G1⊗G2=(V,E), where V=V1×V2, E={((u1,v1)(u2,v2)):u1u2∈E1 and v1v2∈E2}∪{((u,v1)(u,v2)):u∈V1,v1v2∈E2}, ξ(u,v)=ξ1(u)∧ξ2(v) andη((u1,v1)(u2,v2))={η1(u1u2)∧η2(v1v2) if u1u2∈E1 and v1v2∈E2ξ1(u)∧η2(v1v2) if u1=u2=u∈V1 and v1v2∈E2ξ2(v)∧η1(u1u2) if u1u2∈E1 and v1=v2=v∈V2

In 2021, Islam and Pal [23] introduced the first ZI for FGs as:

Definition 2.10 [23] Let G be a connected FG. Then first ZI of G is defined by:FZI1(G)=∑v∈V[ξ(v)deg(v)]2.

Theorem 2.1 [23] Suppose G be a FG having n vertices and m edges. Then,

(i) FZI1(G)≤4n2m2 , (ii) FZI1(G)≤n2T2 and (iii) FZI1(G)≤nΔ2 .

Definition 2.11 [23] Let G be a connected FG. Then second-ZI of G is defined by:FZI2(G)=∑uv∈E[ξ(u)deg(u)ξ(v)deg(v)].

3 Hyper-Zagreb index for fuzzy graph

TIs have a vital role in chemical graph theory. ZIs are such topological descriptors which are degree-based TIs, applied to evaluate π-electron energy of some special type of chemical compound and established by Gutman and Trinajstic [14] in 1972. Now, hyper-ZI is defined as: Definition 3.1 Let G=(V,E) be a connected crisp graph. Then hyper-ZI of the graph G is denoted by HZI(G) and is defined by:HZI(G)=∑uv∈E[deg(u)+deg(v)]2.

In this section, hyper-ZI for a FG is defined and discussed by an example. Then, hyper-ZI is studied for various FGs like path, cycle, star, complete-FG, fuzzy subgraph, partial fuzzy subgraph, etc. Definition 3.2 Let G=(V,E) be a connected FG. Then hyper-ZI of the FG G is denoted by FHZI(G) and is defined by:FHZI(G)=∑uv∈E[ξ(u)deg(u)+ξ(v)deg(v)]2.

Example 3.1 Suppose G=(V,E) be a FG shown in Fig. 1 with V={v1,v2,v3,v4,v5} and E={v1v2,v1v5,v2v3,v2v4,v3v4,v3v5,v4v5} where ξ(v1)=0.5,ξ(v2)=0.7,ξ(v3)=0.6,ξ(v4)=0.5,ξ(v5)=0.9,η(v1v2)=0.5,η(v1v5)=0.0.5,η(v2v3)=0.5,η(v2v4)=0.5,η(v3v4)=0.4,η(v3v5)=0.6,η(v4v5)=0.3. Then degree of the vertices is:deg(v1)=∑vv1∈Eη(vv1)=η(v1v2)+η(v1v5)=0.5+0.5=1.0,deg(v2)=∑vv2∈Eη(vv2)=η(v1v2)+η(v2v3)+η(v2v4)=0.5+0.5+0.5=1.5,deg(v3)=∑vv3∈Eη(vv3)=η(v2v3)+η(v3v4)+η(v3v5)=0.5+0.4+0.6=1.5,deg(v4)=∑vv4∈Eη(vv4)=η(v2v4)+η(v3v4)+η(v4v5)=0.5+0.4+0.3=1.2deg(v5)=∑vv5∈Eη(vv5)=η(v1v5)+η(v3v5)+η(v4v5)=0.5+0.6+0.3=1.4.

Then,FHZI(G)=∑uv∈E[ξ(u)deg(u)+ξ(v)deg(v)]2=(0.5×1.0+0.7×1.5)2+(0.5×1.0+0.5×1.5)2+(0.7×1.5+0.6×1.5)2+(0.7×1.5+0.5×1.2)2+(0.6×1.5+0.5×1.2)2+(0.6×1.5+0.9×1.4)2+(0.5×1.2+0.9×1.4)2=20.7427.

Figure 1 A FG G with FHZI(G)=20.7427.

Figure 1

Now, this index is studied for a path.

Theorem 3.1 Let P be a path. Then, FHZI(P)≤2(4|V(P)|−7)+2FZI2(P) .

Proof From [20], [21], [23], we get,FHZI(P)=∑uv∈E[ξ(u)deg(u)+ξ(v)deg(v)]2=∑uv∈E[ξ2(u)deg2(u)+ξ2(v)deg2(v)]+2∑uv∈E[ξ(u)deg(u)ξ(v)deg(v)]=ξ2(u1)deg2(u1)+ξ2(un)deg2(un)+2∑i=2n−1[ξ2(ui)deg2(ui)]+2FZI2(P)≤2+2∑i=2n−122+2FZI2(P)=2(4n−7)+2FZI2(P).

 □

Theorem 3.2 Let C be a cycle. Then, FHZI(C)≤8|V(C)|+2FZI2(C) .

Proof From [20], [21], [23], we get,FHZI(C)=∑uv∈E[ξ(u)deg(u)+ξ(v)deg(v)]2=∑uv∈E[ξ2(u)deg2(u)+ξ2(v)deg2(v)]+2∑uv∈E[ξ(u)deg(u)ξ(v)deg(v)]=2∑i=1n[ξ(ui)deg(ui)]2+2FZI2(C)≤2∑i=1n22+2FZI2(C)=8n+2FZI2(C).

 □

Theorem 3.3 Suppose, G be a saturated fuzzy cycle with each α-strong edges has membership value α and each β-strong edges has membership value β. Then, FHZI(G)≤4|V(G)|(α+β)2 .

Proof As G is a saturated fuzzy cycle with each α-strong edges has membership value α and each β-strong edges have membership value β, the degree of each vertex of G is α+β. Hence,FHZI(G)=∑uv∈E[ξ(u)deg(u)+ξ(v)deg(v)]2=∑uv∈E[ξ(u)(α+β)+ξ(v)(α+β)]2≤4|V(G)|(α+β)2.

Now, this index is studied for a star. □

Theorem 3.4 Let S be a star. Then, FHZI(S)≤[|V(S)|−1][(|V(S)|−1)2+1]+2FZI2(S) .

Proof From [20], [21], [23], we get,FHZI(S)=∑uv∈E[ξ(u)deg(u)+ξ(v)deg(v)]2=∑uv∈E[ξ2(u)deg2(u)+ξ2(v)deg2(v)]+2∑uv∈E[ξ(u)deg(u)ξ(v)deg(v)]=n[ξ(u0)deg(u0)]2+∑i=1n[ξ(ui)deg(ui)]2+2FZI2(S)≤2FZI2(S)+n3+∑i=1n1=n(n2+1)+2FZI2(S).

 □

Theorem 3.5 Suppose a connected partial fuzzy subgraph H of a FG G. Then, FHZI(H)≤FHZI(G) .

Proof From [20], [21], [23], we get,FHZI(H)=∑uv∈E(H)[ξH(u)degH(u)+ξH(v)degH(v)]2≤∑uv∈E(H)[ξG(u)degG(u)+ξG(v)degG(v)]2≤∑uv∈E(G)[ξG(u)degG(u)+ξG(v)degG(v)]2=FHZI(G).

Let G be any connected FG. Now C(G) is considered as a complete FG with vertex set is V(G) and membership value of each vertex in C(G) is the membership value of that vertex for the FG G. Then clearly, G is a connected partial fuzzy subgraph of the FG C(G). □

Corollary 3.1 Let G be any connected FG. Then, FHZI(G)≤FHZI(C(G)) .

Theorem 3.6 Let G be a complete FG. Then, FHZI(G)≤|V(G)|[|V(G)|−1]3+2FZI2(G) .

Proof From [20], [21], [23], we get,FHZI(G)=∑uv∈E[ξ(u)deg(u)+ξ(v)deg(v)]2=∑uv∈E[ξ2(u)deg2(u)+ξ2(v)deg2(v)]+2∑uv∈E[ξ(u)deg(u)ξ(v)deg(v)]=(n−1)∑i=1n[ξ(ui)deg(ui)]2+2FZI2(G)=(n−1)∑i=1n[ξ(ui){∑j=1i−1ξ(uj)+(n−i)ξ(ui)}]2+2FZI2(G)≤(n−1)∑i=1n[∑j=1i−11+(n−i)]2+2FZI2(G)=(n−1)∑i=1n[n−1]2+2FZI2(G)=n(n−1)3+2FZI2(G).

 □

Theorem 3.7 Let G1 and G2 be two isomorphic connected FGs. Then, FHZI(G1)=FHZI(G2) .

Proof As G1 and G2 be two isomorphic connected FG there exist a bijective map ψ:V(G1)→V(G2) such that, ξG1(v)=ξG2(ψ(v)) and ηG1(uv)=ηG2(ψ(u)ψ(v)),∀u,v∈V(G1) and u≠v. Then,degG1(v)=∑u∈VG1ηG1(uv)=∑ψ(u)∈VG2ηG2(ψ(u)ψ(v))=degG2(ψ(v)).

Therefore,FHZI(G1)=∑uv∈E(G1)[ξG1(u)degG1(u)+ξG1(v)degG1(v)]2=∑ψ(u)ψ(v)∈E(G2)[ξG2(ψ(u))degG2(ψ(u))+ξG2(ψ(v))degG2(ψ(v))]2=FHZI(G2).

Here, a relation between hyper-ZI and second ZI has been established. □

Theorem 3.8 Suppose, G be a FG. Then, FHZI(G)≥4FZI2(G) .

Proof As G is a FG, then,FHZI(G)=∑uv∈E[ξ(u)deg(u)+ξ(v)deg(v)]2=∑uv∈E[ξ2(u)deg2(u)+ξ2(v)deg2(v)]+2∑uv∈Eξ(u)ξ(v)deg(u)deg(v)≥2∑uv∈Eξ(u)ξ(v)deg(u)deg(v)+2∑uv∈Eξ(u)ξ(v)deg(u)deg(v)=4FZI2(G).

 □

4 Bounds on hyper-Zagreb index for fuzzy graphs during operations

In this section, some bounds are established related to hyper-ZI for FGs during FG operations.

Theorem 4.1 FHZI(G1×G2)≤2[m1FZI1(G2)+m2FZI2(G1)+FZI2(G1×G2)+(n1m2Δ2+n2m1Δ1)(Δ1+Δ2)] .

Proof As G1×G2 is CP of G1 and G2, then for (u,v),(u1,v1)∈V,ξ(u,v)=∧{ξ1(u),ξ2(v)} andη((u,v)(u1,v1))={∧{ξ1(u),η2(vv1)} if u=u1,vv1∈E2∧{ξ2(v),η1(uu1)} if uu1∈E1,v=v10otherwise.

Then degG1×G2(u,v)=∑viv∈E2η{(u,v)(u,vi)}+∑uiu∈E1η{(u,v)(ui,v)}=∑viv∈E2∧{ξ1(u),η2(vvi)}+∑uiu∈E1∧{ξ2(v),η1(uui)}≤∑viv∈E2η2(vvi)+∑uiu∈E1η1(uui)=degG1(u)+degG2(v).

Now FHZI(G1×G2)=∑(u1,v1)(u2,v2)∈E[ξ(u1,v1)degG1×G2(u1,v1)+ξ(u2,v2)degG1×G2(u2,v2)]2=∑(u1,v1)(u2,v2)∈E[ξ2(u1,v1)degG1×G22(u1,v1)+ξ2(u2,v2)degG1×G22(u2,v2)]+2∑(u1,v1)(u2,v2)∈E[ξ(u1,v1)ξ(u2,v2)degG1×G2(u1,v1)degG1×G2(u2,v2)]=∑u∈V1v1v2E2[ξ2(u,v1)degG1×G22(u,v1)+ξ2(u,v2)degG1×G22(u,v2)]︸K1+∑v∈V2u1u2E1[ξ2(u1,v)degG1×G22(u1,v)+ξ2(u2,v)degG1×G22(u2,v)]︸K2+2FZI2(G1×G2).

Now K1=∑u∈V1v1v2E2[ξ2(u,v1)degG1×G22(u,v1)+ξ2(u,v2)degG1×G22(u,v2)]≤∑u∈V1v1v2E2[ξ2(u)degG12(u)+ξ(u)ξ(v1)degG1(u)degG2(v1)+ξ2(v1)degG22(v1)+ξ2(u)degG12(u)+ξ(u)ξ(v2)degG1(u)degG2(v2)+ξ2(v2)degG22(v2)]≤2m2∑u∈V1[ξ(u)degG1(u)]2+∑u∈V1∑v1v2E2[ξ2(v1)degG22(v1)+ξ2(v2)degG22(v2)]+∑u∈V1ξ(u)degG1(u)∑v1v2E2[ξ(v1)degG2(v1)+ξ(v2)degG2(v2)]≤2m2FZI1(G1)+2n1m2Δ1Δ2+2n1m2Δ22=2m2FZI1(G1)+2n1m2Δ2(Δ1+Δ2).

Simillarly K2≤2m1FZI1(G2)+2n2m1Δ1(Δ1+Δ2).∴FHZI(G1×G2)≤2[m1FZI1(G2)+m2FZI1(G1)+FZI2(G1×G2)+(n1m2Δ2+n2m1Δ1)(Δ1+Δ2)].

 □

Theorem 4.2 FHZI(G1[G2])≤2[m2n22FZI1(G1)+m1FZI1(G2)+FZI2(G1[G2])+m1n24Δ12+n1m2Δ22+2n2(m1n22+m2n1)Δ1Δ2] .

Proof As G1[G2] is composition graph of G1 and G2, then for (u,v),(u1,v1)∈V,ξ(u,v)=∧{ξ1(u),ξ2(v)} andη((u,v)(u1,v1))={∧{ξ1(u),η2(vv1)} if u=u1,vv1∈E2∧{ξ2(v),ξ2(v1),η1(uu1)} if uu1∈E10 otherwise.

Then degG1[G2](u,v)=∑viv∈E2η{(u,v)(u,vi)}+∑uiu∈E1,vj∈V2η{(u,v)(ui,vj)}=∑viv∈E2∧{ξ1(u),η2(vvi)}+∑uiu∈E1,vj∈V2∧{ξ2(v),ξ2(vj)η1(uui)}≤∑viv∈E2η2(vvi)+∑uiu∈E1,vj∈V2η1(uui)=n2degG1(u)+degG2(v).

Now, FHZI(G1[G2])=∑(u1,v1)(u2,v2)∈E[ξ(u1,v1)degG1[G2](u1,v1)+ξ(u2,v2)degG1[G2](u2,v2)]2=∑(u1,v1)(u2,v2)∈E[ξ2(u1,v1)degG1[G2]2(u1,v1)+ξ2(u2,v2)degG1[G2]2(u2,v2)]+2∑(u1,v1)(u2,v2)∈E[ξ(u1,v1)ξ(u2,v2)degG1[G2](u1,v1)degG1[G2](u2,v2)]=∑u∈V1,v1v2∈E2[ξ2(u,v1)degG1[G2]2(u,v1)+ξ2(u,v2)degG1[G2]2(u,v2)]︸K1+∑u1u2∈E1,v1v2∈V2[ξ2(u1,v1)degG1[G2]2(u1,v1)+ξ2(u2,v2)degG1[G2]2(u2,v2)]︸K2+2FZI2(G1[G2]).

Now K1=∑u∈V1,v1v2∈E2[ξ2(u,v1)degG1[G2]2(u,v1)+ξ2(u,v2)degG1[G2]2(u,v2)]≤∑u∈V1,v1v2∈E2[{n2ξ1(u)degG1(u)+ξ2(v1)degG2(v1)}2+{n2ξ1(u)degG1(u)+ξ2(v2)degG2(v2)}2]=2n22∑u∈V1,v1v2∈E2ξ12(u)degG12(u)+∑u∈V1,v1v2∈E2[ξ22(v1)degG22(v1)+ξ22(v2)degG22(v2)]+2n2∑u∈V1ξ1(u)degG1(u)∑v1v2∈E2[ξ2(v1)degG2(v1)+ξ2(v2)degG2(v2)]≤2m2n22FZI1(G1)+2n1m2Δ22+4n1n2m2Δ1Δ2.

Again K2=∑u1u2∈E1,v1v2∈V2[ξ2(u1,v1)degG1[G2]2(u1,v1)+ξ2(u2,v2)degG1[G2]2(u2,v2)]≤∑u1u2∈E1,v1,v2∈V2[{n2ξ1(u1)degG1(u1)+ξ2(v1)degG2(v1)}2+{n2ξ1(u2)degG1(u2)+ξ2(v2)degG2(v2)}2]=n22∑u1u2∈E1,v1,v2∈V2[ξ12(u1)degG12(u1)+ξ12(u2)degG12(u2)]+∑u1u2∈E1,v1,v2∈V2[ξ22(v1)degG22(v1)+ξ22(v2)degG22(v2)]+2n2∑u1u2∈E1,v1,v2∈V2[ξ1(u1)ξ2(v1)degG2(u1)degG2(v1)+ξ1(u2)ξ2(v2)degG2(u2)degG2(v2)]≤2m1FZI1(G2)+2m1n24Δ12+4m1n23Δ1Δ2.

∴FHZI(G1[G2])≤2[m2n22FZI1(G1)+m1FZI1(G2)+FZI2(G1[G2])+m1n24Δ12+n1m2Δ22+2n2(m1n22+m2n1)Δ1Δ2].

 □

Theorem 4.3 n2FZI1(G1)+n1FZI1(G2)+2FZI2(G1)+2FZI2(G2)+FZI2(G1+G2)≤FHZI(G1+G2)≤n2FZI1(G1)+n1FZI1(G2)+FZI2(G1+G2)+n1n2(n12+n22)+2n1n2(n2Δ1+n1Δ2)+2m1(n2+Δ1)2+2m2(n1+Δ2)2 .

Proof As G1+G2 is join of G1 and G2, then for u,v∈V,ξ(u)={ξ1(u),if u∈V1ξ2(u),otherwise

and η(uv)={∧{ξ1(u),ξ2(v)} if u∈V1,v∈V2η1(uv) if uv∈E1η2(uv) if uv∈E20otherwise.

Then,degG1+G2(u)={degG1(u)+∑v∈V2∧{ξ1(u),ξ2(v)},u∈V1degG2(u)+∑v∈V1∧{ξ2(u),ξ1(v)},u∈V2≥{degG1(u),u∈V1degG2(u),u∈V2.

Also, the followings are hold:degG1+G2(u)≤{degG1(u)+∑v∈V2ξ1(u),u∈V1degG2(u)+∑v∈V1ξ2(u),u∈V2≤{degG1(u)+n2ξ1(u),u∈V1degG2(u)+n1ξ2(u),u∈V2

Now, FHZI(G1+G2)=∑uv∈E[ξ(u)degG1+G2(u)+ξ(v)degG1+G2(v)]2=∑uv∈E[ξ2(u)degG1+G22(u)+ξ2(v)degG1+G22(v)]+2∑uv∈Eξ(u)ξ(v)degG1+G2(u)degG1+G2(v)=∑uv∈E1[ξ2(u)degG1+G22(u)+ξ2(v)degG1+G22(v)]︸K1+∑uv∈E2[ξ2(u)degG1+G22(u)+ξ2(v)degG1+G22(v)]︸K2+∑u∈V1,v∈V2[ξ2(u)degG1+G22(u)+ξ2(v)degG1+G22(v)]︸K3+2FZI2(G1+G2).

Now K1=∑uv∈E1[ξ2(u)degG1+G22(u)+ξ2(v)degG1+G22(v)]≤∑uv∈E1[ξ12(u){degG1(u)+n2ξ1(u)}2+ξ12(v){degG1(v)+n2ξ1(v)}2]≤2∑uv∈E1(n2+Δ1)2=2m1(n2+Δ1)2.Again, K1=∑uv∈E1[ξ2(u)degG1+G22(u)+ξ2(v)degG1+G22(v)]≥∑uv∈E1[ξ12(u)degG12(u)+ξ12(v)degG12(v)]≥2∑uv∈E1[ξ1(u)ξ1(v)degG1(u)degG1(v)]=2FZI2(G1).

Therefore, 2FZI2(G1)≤K1≤2m1(n2+Δ1)2.

Similarly, 2FZI2(G2)≤K2≤2m2(n1+Δ2)2.Also, K3=∑u∈V1,v∈V2[ξ2(u)degG1+G22(u)+ξ2(v)degG1+G22(v)]≤∑u∈V1,v∈V2[ξ12(u){degG1(u)+n2ξ1(u)}2+ξ22(v){degG2(v)+n1ξ2(v)}2]≤n2FZI1(G1)+n1FZI1(G2)+n1n2(n12+n22)+2n1n2(n2Δ1+n1Δ2)and K3=∑u∈V1,v∈V2[ξ2(u)degG1+G22(u)+ξ2(v)degG1+G22(v)]≥∑u∈V1,v∈V2[ξ12(u)degG12(u)+ξ22(v)degG22(v)]=n2FZI1(G1)+n1FZI1(G2).

Therefore, n2FZI1(G1)+n1FZI1(G2)≤K3≤n2FZI1(G1)+n1FZI1(G2)+n1n2(n12+n22)+2n1n2(n2Δ1+n1Δ2).

Using the value of K1,K2,K3 one can get the result easily. □

Theorem 4.4 FHZI(G1∪G2)≥2[FZI2(G1∪G2)+(m1−m)δ1+(m2−m)δ2+mδ] , where m=|E1∩E2|,δ=∧{δ1,δ2} .

Proof As G1∪G2 is union of G1 and G2, then for u,v∈Vξ(u)={ξ1(u),u∈V1∖V2ξ2(u),u∈V2∖V1∨{ξ1(u),ξ2(u)},u∈V1∩V2

and η(u,v)={η1(u,v)uv∈E1∖E2η2(u,v)uv∈E2∖E1∨{ξ1(u,v),ξ2(u,v)}(u,v)∈E1∩E20 otherwise.

Then,degG1∪G2(u)≥{deg1(u)u∈V1∖V2deg2(u)u∈V2∖V1deg1(u) or deg2(u)u∈V1∩V2

Now, FHZI(G1∪G2)=∑uv∈E[ξ(u)degG1∪G2(u)+ξ(v)degG1∪G2(v)]2=∑uv∈E[ξ2(u)degG1∪G22(u)+ξ2(v)degG1∪G22(v)]+2FZI2(G1∪G2)=∑uv∈E1∖E2[ξ2(u)degG1∪G22(u)+ξ2(v)degG1∪G22(v)]+∑uv∈E2∖E1[ξ2(u)degG1∪G22(u)+ξ2(v)degG1∪G22(v)]+∑uv∈E1∩E2[ξ2(u)degG1∪G22(u)+ξ2(v)degG1∪G22(v)]+2FZI2(G1∪G2)≥∑uv∈E1∖E2[ξ12(u)degG12(u)+ξ12(v)degG12(v)]+∑uv∈E2∖E1[ξ22(u)degG22(u)+ξ22(v)degG22(v)]+∑uv∈E1∩E2[ξ2(u)degG1∪G22(u)+ξ2(v)degG1∪G22(v)]+2FZI2(G1∪G2)≥2FZI2(G1∪G2)+2(m1−m)δ1+2(m2−m)δ2+2mδ.

 □

Theorem 4.5 FHZI(G1∏G2)≤2m1m2max⁡{Δ12,Δ22}+2FZI2(G1∏G2) .

Proof As G1∏G2 is direct product graph of G1 and G2, then, ξ(u,v)=ξ1(u)∧ξ2(v) and η((u1,v1)(u2,v2))=η1(u1u2)∧η2(v1v2). Hence,degG1∏G2(u,v)=∑(u1,v1)∈Vη((u,v)(u1,v1))=∑(u1,v1)∈Vη1(u,u1)∧η2(v,v1)≤degG1(u)∧degG2(v)≤max⁡{Δ1,Δ2}.

Therefore,FHZI(G1∏G2)=∑(u1,v1)(u2,v2)∈E[ξ(u1,v1)degG1∏G2(u1,v1)+ξ(u2,v2)degG1∏G2(u2,v2)]2=∑(u1,v1)(u2,v2)∈E[ξ2(u1,v1)degG1∏G22(u1,v1)+ξ2(u2,v2)degG1∏G22(u2,v2)]+2FZI2(G1∏G2)≤2m1m2max⁡{Δ12,Δ22}+2FZI2(G1∏G2).

 □

Theorem 4.6 FHZI(G1•G2)≤2m2FZI1(G1)+2FZI2(G1•G2)+8n1m2Δ2(Δ1+Δ2)+2m1m2(Δ1+2Δ2)2 .

Proof As G1•G2 is semi-strong product graph of G1 and G2, then, ξ(u,v)=ξ1(u)∧ξ2(v) andη((u1,v1)(u2,v2))={η1(u1u2)∧η2(v1v2) if u1u2∈E1 and v1v2∈E2ξ1(u)∧η2(v1v2) if u1=u2=u∈V1 and v1v2∈E2.

Hence,degG1•G2(u,v)=∑uu1∈E1,vv1∈E2η((u,v)(u1,v1))+∑vv1∈E2η((u,v)(u,v1))=∑uu1∈E1,vv1∈E2η1(uu1)∧η2(vv1)+∑vv1∈E2ξ1(u)∧η2(vv1)≤∑uu1∈E1η1(uu1)+∑vv1∈E2η2(vv1)+∑vv1∈E2η2(vv1)=degG1(u)+2degG2(v).

Therefore,FHZI(G1•G2)=∑(u1,v1)(u2,v2)∈E[ξ(u1,v1)degG1•G2(u1,v1)+ξ(u2,v2)degG1•G2(u2,v2)]2=∑(u1,v1)(u2,v2)∈E[ξ2(u1,v1)degG1•G22(u1,v1)+ξ2(u2,v2)degG1•G22(u2,v2)]+2FZI2(G1•G2)=∑u1u2∈E1,v1v2∈E2[ξ2(u1,v1)degG1•G22(u1,v1)+ξ2(u2,v2)degG1•G22(u2,v2)]︸K1+∑u∈V1,v1v2∈E2[ξ2(u,v1)degG1•G22(u,v1)+ξ2(u,v2)degG1•G22(u,v2)]︸K2+2FZI2(G1•G2).

Now,K1=∑u1u2∈E1,v1v2∈E2[ξ2(u1,v1)degG1•G22(u1,v1)+ξ2(u2,v2)degG1•G22(u2,v2)]≤∑u1u2∈E1,v1v2∈E2[ξ2(u1,v1){degG1(u1)+2degG2(v1)}2+ξ2(u2,v2){degG1(u2)+2degG2(v2)}2]≤2∑u1u2∈E1,v1v2∈E2[Δ1+2Δ2]2=2m1m2[Δ1+2Δ2]2.

Again,K2=∑u∈V1,v1v2∈E2[ξ2(u,v1)degG1•G22(u,v1)+ξ2(u,v2)degG1•G22(u,v2)]≤∑u∈V1,v1v2∈E2[ξ2(u,v1){degG1(u)+2degG2(v1)}2+ξ2(u,v2){degG1(u)+2degG2(v2)}2]≤∑u∈V1,v1v2∈E2[{ξ2(u)degG12(u)+4degG22(v1)+4degG1(u)degG2(v1)}+{ξ2(u)degG12(u)+4degG22(v2)+4degG1(u)degG2(v2)}]≤2∑u∈V1,v1v2∈E2{ξ2(u)degG12(u)}+∑u∈V1,v1v2∈E2[{4degG22(v1)+4degG1(u)degG2(v1)+4degG22(v2)+4degG1(u)degG2(v2)}]≤2m2FZI1(G1)+8∑u∈V1,v1v2∈E2Δ2(Δ1+Δ2)=2m2FZI1(G1)+8n1m2Δ2(Δ1+Δ2).

Hence,FHZI(G1•G2)=K1+K2+2FZI2(G1•G2)≤2m2FZI1(G1)+2FZI2(G1•G2)+8n1m2Δ2(Δ1+Δ2)+2m1m2(Δ1+2Δ2)2.

 □

Theorem 4.7 FHZI(G1⊗G2)≤8m2FZI1(G1)+8m1FZI1(G2)+2FZI2(G⊗G2)+4(n1m2+n2m1+2m1m2)(Δ1+Δ2)2 .

Proof As G1⊗G2 is strong product graph of G1 and G2, then, ξ(u,v)=ξ1(u)∧ξ2(v) andη((u1,v1)(u2,v2))={η1(u1u2)∧η2(v1v2) if u1u2∈E1 and v1v2∈E2ξ1(u)∧η2(v1v2) if u1=u2=u∈V1 and v1v2∈E2ξ2(v)∧η1(u1u2) if u1u2∈E1 and v1=v2=v∈V2

Hence,degG1⊗G2(u,v)=∑uu1∈E1,vv1∈E2η((u,v)(u1,v1))+∑vv1∈E2η((u,v)(u,v1))+∑uu1∈E1η((u,v)(u1,v))=∑uu1∈E1,vv1∈E2η1(uu1)∧η2(vv1)+∑vv1∈E2ξ1(u)∧η2(vv1)+∑uu1∈E1ξ2(v)∧η1(uu1)≤∑uu1∈E1η1(uu1)+∑vv1∈E2η2(vv1)+∑vv1∈E2η2(vv1)+∑uu1∈E1η1(uu1)=2[degG1(u)+degG2(v)].

Therefore,FHZI(G1⊗G2)=∑(u1,v1)(u2,v2)∈E[ξ(u1,v1)degG1⊗G2(u1,v1)+ξ(u2,v2)degG1⊗G2(u2,v2)]2=∑(u1,v1)(u2,v2)∈E[ξ2(u1,v1)degG1⊗G22(u1,v1)+ξ2(u2,v2)degG1⊗G22(u2,v2)]+2FZI2(G1⊗G2)=∑u1u2∈E1,v1v2∈E2[ξ2(u1,v1)degG1⊗G22(u1,v1)+ξ2(u2,v2)degG1⊗G22(u2,v2)]︸K1+∑u∈V1,v1v2∈E2[ξ2(u,v1)degG1⊗G22(u,v1)+ξ2(u,v2)degG1⊗G22(u,v2)]︸K2+∑u1u2∈E1,v∈V2[ξ2(u1,v)degG1⊗G22(u1,v)+ξ2(u2,v)degG1⊗G22(u2,v)]︸K3+2FZI2(G1⊗G2)

Now,K1=∑u1u2∈E1,v1v2∈E2[ξ2(u1,v1)degG1⊗G22(u1,v1)+ξ2(u2,v2)degG1⊗G22(u2,v2)]≤4∑u1u2∈E1,v1v2∈E2[ξ2(u1,v1){degG1(u1)+degG2(v1)}2+ξ2(u2,v2){degG1(u2)+degG2(v2)}2]≤8m1m2(Δ1+Δ2)2.

Again,K2=∑u∈V1,v1v2∈E2[ξ2(u,v1)degG1⊗G22(u,v1)+ξ2(u,v2)degG1⊗G22(u,v2)]≤4∑u∈V1,v1v2∈E2[ξ2(u,v1){degG1(u)+degG2(v1)}2+ξ2(u,v2){degG1(u)+degG2(v2)}2]≤4∑u∈V1,v1v2∈E2[ξ2(u,v1){degG12(u)+degG22(v1)+degG1(u)degG2(v1)}+ξ2(u,v2){degG12(u)+degG22(v2)+degG1(u)degG2(v2)}]=4∑u∈V1,v1v2∈E2[degG22(v1)+2degG1(u)degG2(v1)+degG22(v2)]+8∑u∈V1,v1v2∈E2ξ2(u,v1)degG12(u)≤8m2FZI1(G1)+4n1m2(Δ12+Δ22+2Δ1Δ2)=8m2FZI1(G1)+4n1m2(Δ1+Δ2)2.

Similarly,K3=∑u1u2∈E1,v∈V2[ξ2(u1,v)degG1⊗G22(u1,v)+ξ2(u2,v)degG1⊗G22(u2,v)]≤8m1FZI1(G2)+4n2m1(Δ1+Δ2)2.

Hence,FHZI(G⊗G2)=K1+K2+K3+2FZI2(G⊗G2)≤8m1m2(Δ1+Δ2)2+8m2FZI1(G1)+4n1m2(Δ1+Δ2)2+8m1FZI1(G2)+4n2m1(Δ1+Δ2)2+2FZI2(G⊗G2)=8m2FZI1(G1)+8m1FZI1(G2)+2FZI2(G⊗G2)+4(n1m2+n2m1+2m1m2)(Δ1+Δ2)2.

 □

5 Application

Crime is a pervasive global issue that reflects a grim aspect of society. Different countries delineate crime in various ways, but acts of violence consistently pose a significant threat to societal well-being. In India, the recording of crimes dates back to the British Raj, with the National Crime Records Bureau, operating under the Ministry of Home Affairs, compiling annual statistics. As of 2020, there were 66 lakh admissible offences, comprising 42.5 lakh Indian Penal Code (IPC) offences and 23.5 lakh Special and Local Law (SLL) offences. This represents a notable annual increase in crime of 28.02%. A substantial portion of these registered crimes—more than one-fifth—were categorized as crimes affecting the human body, encompassing violent acts such as murder, kidnapping, assault and death by negligence. In this section, we focus on the analysis of the crime of “murder” across various states in India.

In this section, we examine the crime of “murder” across different states in India. Specifically, we explore the extent to which the incidence of this crime in a state is influenced by criminals from its neighboring states as well as within its own jurisdiction.

5.1 Graph construction

Our objective is to examine the impact of crime within a state, both from neighboring states and within its own jurisdiction. In this analysis, each state is represented as a vertex and an edge is established between neighboring states. States that are not immediate neighbors exert considerably less influence on crime and therefore, no edges are considered for such pairs.

5.2 Assigning membership values

The vertex membership value of a state (S) is contingent upon the number of murders occurring per ten lakh population (n(S)). A high value of n(S) signifies a high crime rate in state S, while a lower value indicates a lower crime rate. Therefore, the vertex membership value of a state Si is defined as:ξ(Si)=n(Si)∨{n(S):S is a state of India}.

It's important to note that a higher membership value of a state indicates lower safety for its people, while a lower membership value signifies higher safety. In many cases, perpetrators seek refuge in neighboring states, making the study of this type of crime imperative. Consequently, edges are established between neighboring states. The edge membership value is contingent upon the influence relationship between states regarding the occurrence of crime. Therefore, the edge membership value for an edge SiSj is defined as:η(SiSj)=min⁡{ξ(Si),ξ(Sj)}.

Note that η(SiSj) represents the maximum effect of the crime for Si by the state's criminal Sj or Sj by the criminal of the state Si. The higher membership value of an edge represents the lower safety for the people of the two states. The lower membership value of an edge represents the higher safety for the people of the two states. The set of vertices and vertex membership values are listed in Table 1 and the set of edges and edge membership values are listed in Table 2. Hence the model FG G is shown in Fig. 2.Table 1 Vertex membership value.

Table 1State name	Vertex name	Number of murder per ten Lakh population	Vertex membership value	
Andhra Pradesh	AnP	1.6	0.38	
Arunachal Pradesh	ArP	3.0	0.71	
Assam	Ass	3.3	0.79	
Bihar	Bih	2.6	0.62	
Chhattisgarh	Chh	3.3	0.79	
Goa	Goa	2.2	0.52	
Gujarat	Guj	1.4	0.33	
Haryana	Har	3.9	0.93	
Himachal Pradesh	HP	1.2	0.29	
Jharkhand	Jha	4.2	1.00	
Karnataka	Kar	2.0	0.48	
Kerala	Ker	0.9	0.21	
Madhya Pradesh	MP	2.5	0.60	
Maharashtra	Mah	1.7	0.40	
Manipur	Man	1.5	0.36	
Meghalaya	Meg	2.4	0.57	
Mizoram	Miz	2.3	0.55	
Nagaland	Nag	1.1	0.26	
Odisha	Odi	3.2	0.76	
Punjab	Pun	2.5	0.60	
Rajasthan	Raj	2.2	0.52	
Sikkim	Sik	1.6	0.38	
Tamil Nadu	TN	2.2	0.52	
Telangana	Tel	2.1	0.50	
Tripura	Tri	2.8	0.67	
Uttar Pradesh	UP	1.7	0.40	
Uttarakhand	UK	1.4	0.33	
West Bengal	WB	2.0	0.48	

Table 2 Edge membership value.

Table 2Edge name	Edge membership value	Edge name	Edge membership value	Edge name	Edge membership value	Edge name	Edge membership value	
AnP-Chh	0.38	AnP-Kar	0.38	AnP-Odi	0.38	AnP-TN	0.38	
AnP-Tel	0.38	ArP-Ass	0.71	ArP-Nag	0.26	Ass-Man	0.36	
Ass-Meg	0.57	Ass-Miz	0.55	Ass-Nag	0.26	Ass-Tri	0.67	
Ass-WB	0.48	Bih-Jha	0.62	Bih-UP	0.40	Bih-WB	0.48	
Chh-Jha	0.79	Chh-MP	0.6	Chh-Mah	0.4	Chh-Odi	0.76	
Chh-Tel	0.50	Chh-UP	0.40	Goa-Kar	0.48	Goa-Mah	0.40	
Guj-MP	0.33	Guj-Mah	0.33	Guj-Raj	0.33	Har-HP	0.29	
Har-Pun	0.60	Har-Raj	0.52	Har-UP	0.40	Har-UK	0.33	
HP-Pun	0.29	HP-UK	0.29	Jha-Odi	0.76	Jha-UP	0.40	
Jha-WB	0.48	Kar-Ker	0.21	Kar-Mah	0.40	Kar-TN	0.48	
Kar-Tel	0.48	Ker-TN	0.21	MP-Mah	0.40	MP-Raj	0.52	
MP-UP	0.40	Mah-Tel	0.40	Man-Miz	0.36	Man-Nag	0.26	
Miz-Tri	0.55	Odi-WB	0.48	Pun-Raj	0.52	Raj-UP	0.40	
Sik-WB	0.38	UP-UK	0.33					

Figure 2 Model fuzzy graph G.

Figure 2

5.3 Method to determine the crime affected for a state by the criminal of its neighbor states and itself

In our investigation of the impact of crime on a state by criminals from its neighboring states and within its own jurisdiction, we adhere to the following steps:

Step 1: For each state S, we construct an induced fuzzy subgraph of G, comprising the vertices S and its neighboring states. Let G(S) denote the fuzzy subgraph corresponding to the state S. It's important to note that the vertex membership and edge membership values in G(S) remain consistent with those in the model FG.

Step 2: For each State S, the degree of each vertex Si is evaluated by the formula:degG(S)(Si)=∑SiSj∈E(G(S))η(SiSj).

In this context, the degree of vertex Si signifies the cumulative impact of crime on Si by criminals from its neighboring states. It's worth noting that this calculation excludes the impact of crime by Si on itself.

Step 3: Now, the score of a state is hyper-ZI for the fuzzy subgraph G(S) and which is calculated by the formula:Score(S)=FHZI(G(S))=∑SiSj∈E(G(S))[ξG(S)(Si)degG(S)(Si)+ξG(S)(Sj)degG(S)(Sj)]2.

The score of a state is closely linked to its neighboring states; when the crime rate of a neighboring state is high, the score of the state in question also increases and vice versa. Additionally, the impact of crime on the state S itself is taken into account. Therefore, the score reflects the total extent of crime affecting the state, originating from both its neighboring states and its own jurisdiction.

5.4 Illustration

In this section, we have elucidated the methodology for assessing the impact of crime on a state, taking into account both the criminal activities of neighboring states and those within the state itself. To illustrate, we focus on the state of “Madhya Pradesh” as a case study.

Step 1: The neighboring vertices of Madhya Pradesh (MP) include Chhattisgarh (Chh), Gujarat (Guj), Maharashtra (Mah), Rajasthan (Raj) and Uttar Pradesh (UP). Thus, the vertex set comprises {Chh, Guj, MP, Mah, Raj, UP}. Consequently, the fuzzy subgraph G(MP) is depicted in Fig. 3.Figure 3 The fuzzy subgraph G(MP).

Figure 3

Step 2: Here, the degree of each vertex for the FG G(MP) is calculated by the formula:degG(MP)(Si)=∑SiSj∈E(G(MP))η(SiSj).

Using above formula, degree of each vertices is: degG(MP)(Chh)=1.40, degG(MP)(Guj)=1.00, degG(MP)(MP)=2.26, degG(MP)(Mah)=1.14, degG(MP)(Raj)=1.26, degG(MP)(UP)=1.21.

Step 3: Now, the score of the state Madhya Pradesh is calculated by the formula:Score(MP)=∑SiSj∈E(G(MP))[ξG(MP)(Si)degG(MP)(Si)+ξG(MP)(Sj)degG(MP)(Sj)]2.

The score of Madhya Pradesh is determined to be 27.45267. Likewise, the score for each state can be calculated accordingly. Table 3 presents the score values for all states.Table 3 Score value of each vertex for different topological indices.

Table 3Vertex name	Hyper-ZI for FGs (Hyper-ZIF)	Hyper-ZI for crisp graphs (Hyper-ZIC)	First ZI for FGs (First-ZIF)	F-index for FGs (FF-index)	
AnP	23.27	412	2.01	1.93	
ArP	3.66	48	0.55	0.40	
Ass	82.23	712	5.04	12.01	
Bih	16.54	136	1.71	2.15	
Chh	63.53	678	4.17	7.80	
Goa	1.96	48	0.25	0.10	
Guj	4.73	136	0.48	0.29	
Har	38.02	500	2.81	4.52	
HP	7.19	136	0.82	0.80	
Jha	107.04	500	7.76	18.34	
Kar	20.30	610	1.35	1.14	
Ker	0.86	48	0.12	0.04	
MP	27.45	500	2.02	2.16	
Mah	27.68	610	2.04	1.86	
Man	5.65	136	0.61	0.47	
Meg	0.60	4	0.15	0.06	
Miz	14.20	136	1.44	1.47	
Nag	7.22	136	0.84	0.72	
Odi	57.31	256	4.99	8.93	
Pun	13.09	136	1.36	1.49	
Raj	29.65	412	2.38	2.73	
Sik	0.11	4	0.03	0.00	
TN	3.30	136	0.33	0.17	
Tel	16.00	340	1.29	1.07	
Tri	7.51	48	0.96	0.81	
UP	62.75	856	4.86	6.57	
UK	5.02	136	0.56	0.46	
WB	26.59	170	3.07	4.45	

It's noteworthy that the state of Sikkim has the lowest score value, indicating that it experiences the least impact from the criminal activities of its neighboring states as well as within its own jurisdiction. Conversely, for the state of Jharkhand, the highest score value implies that it faces the greatest impact from the criminal activities of its neighboring states and within its own jurisdiction.

5.5 Comparative analysis

To compare, we consider other topological indices: the first ZI for FGs, the F-index for FGs and the hyper-ZI for crisp graphs, to assess the impact of crime on a state by the criminals of its neighboring states and within its own jurisdiction. It's important to note that topological indices defined solely for crisp graphs are independent of the nature of the vertex or its neighboring vertices, meaning they do not consider the number of crimes in any state or its neighbors. Consequently, these indices cannot accurately predict actual crime rates. Therefore, incorporating fuzziness is essential for making such considerations.

The hyper-ZI for FGs takes into account not only the number of crimes in each state but also the total number of crimes in neighboring states for each state. As a result, this index consistently yields realistic results compared to other existing indices. The scores of each state for these indices are presented in Table 3. As shown in the table, each index identifies “Sikkim” as having the lowest score, indicating the lowest impact of crime by the criminals of its neighboring state and itself. All indices, except the hyper-ZI for crisp graphs, identify “Jharkhand” as having the highest score, indicating the highest impact of crime by the criminals of its neighboring state and itself. However, the hyper-ZI defined for crisp graphs assigns the same score value to different states. If decision-makers were to rely solely on indices for crisp graphs, they would be unable to distinguish between states. Therefore, it is imperative to introduce topological indices defined for FGs.

We also fit linear curves among the score values obtained by these indices (See Fig. 4). The relationship between these indices with respect to the scores is shown below: Hyper-ZIC =6.8402(Hyper-ZIF)+120.48,R=0.7535, First-ZIF =0.0053(Hyper-ZIC)+0.406,R=0.6972, FF-index =2.1783(First-ZIF)−1.2407,R=0.9652, Hyper-ZIF =14.127(First-ZIF)−3.201,R=0.9832, FF-index =0.1526(Hyper-ZIF)−0.7074,R=0.9713 and  Hyper-ZIC =33.815(FF-index)+184.85,R=0.5851.

The correlation coefficient value (R) indicates that the score derived from the hyper-ZI for FGs is strongly correlated with the scores obtained from the first ZI and F-index for FGs. However, it exhibits a weaker correlation with the score obtained from the hyper-ZI for crisp graphs.Figure 4 Linear curves fitting among the score values obtained by different indices.

Figure 4

6 Conclusion

The hyper-ZI plays a crucial role in various fields including chemical graph theory, spectral graph theory, network theory, molecular chemistry and FG (FG) theory. In this study, we have defined the hyper-ZI specifically for FGs and explored its properties across various types of FGs, such as paths, cycles, stars, complete FGs and partial fuzzy subgraphs. Notably, we have demonstrated that the value of this index remains consistent for isomorphic FGs. Furthermore, we have established intriguing relationships between the second ZI and the hyper-ZI for FGs and determined the bounds of this index for operations including Cartesian product, composition, join, union, strong product, semi-strong product and direct product of two FGs. Additionally, we have applied the hyper-ZI to analyze the crime of “Murder” across states in India and compared its performance with three other topological indices: the hyper-ZI for crisp graphs, the first ZI for FGs and the F-index for FGs. Our findings suggest that while the hyper-ZI for FGs, the first ZI for FGs and the F-index for FGs yield similar results, the hyper-ZI for FGs provides more realistic results compared to its crisp counterpart in detecting crime in India. Specifically, we have identified that the state of Sikkim experiences the lowest impact from crime, while Jharkhand faces the highest impact from criminal activities of both neighboring states and within its own jurisdiction.

Moving forward, the future scopes of this research include:

(i) While this article focuses on establishing the maximal n-vertex FG concerning the hyper-ZI, determining the n-vertex FG with the minimum hyper-ZI remains an open question.

(ii) The investigation into which n-vertex tree (fuzzy) exhibits the minimum or maximum hyper-ZI is an area for further research.

(iii) Similarly, identifying which n-vertex unicyclic graph (fuzzy) has the minimum or maximum hyper-ZI presents an opportunity for future exploration.

Ethical approval

This article does not contain any studies with human participants or animals performed by any of the authors.

CRediT authorship contribution statement

Sk Rabiul Islam: Writing – review & editing, Writing – original draft, Visualization, Validation, Methodology, Investigation, Formal analysis, Data curation, Conceptualization. Bandar Bin Mohsin: Project administration. Madhumangal Pal: Writing – review & editing, Supervision.

Declaration of Competing Interest

The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.

Data availability

All the data are collected from the website of NATIONAL CRIME RECORDS BUREAU (Govt. of India) https://ncrb.gov.in/en/crime-india.

Acknowledgements

This paper is supported by Researchers Supporting Project number (RSP2024R158 ), King Saud University, Riyadh, Saudi Arabia.
==== Refs
References

1 Akram M. Bipolar fuzzy graphs Inf. Sci. 181 24 2011 5548 5564
2 Akram M. Dudek W.A. Interval-valued fuzzy graphs Comput. Math. Appl. 61 2 2011 289 299
3 Ananthanarayanan M. Lavanya S. Fuzzy graph coloring using α-cut Int. J. Eng. Appl. Sci. 4 10 2014 23 28
4 Bhutani K.R. Rosenfeld A. Strong arcs in fuzzy graphs Inf. Sci. 152 2003 319 322
5 Bhutani K.R. Rosenfeld A. Fuzzy end nodes in fuzzy graphs Inf. Sci. 152 2003 323 326
6 Bhutani K.R. Battou A. On M-strong fuzzy graphs Inf. Sci. 155 1–2 2003 103 109
7 Bhutani K.R. Rosenfeld A. Geodesies in fuzzy graphs Electron. Notes Discrete Math. 15 2003 49 52
8 Binu M. Mathew S. Mordeson J.N. Connectivity index of a fuzzy graph and its application to human trafficking Fuzzy Sets Syst. 360 2019 117 136
9 Binu M. Mathew S. Mordeson J.N. Wiener index of a fuzzy graph and application to illegal immigration networks Fuzzy Sets Syst. 384 2020 132 147
10 Fang J. Nazeer I. Rashid T. Liu J.B. Connectivity and Wiener index of fuzzy incidence graphs Math. Probl. Eng. 2021 2021 1 7
11 Fortual B. Gutman I. A forgotten topological index J. Math. Chem. 53 4 2015 1184 1190
12 Ghorai G. Pal M. Some isomorphic properties of m-polar fuzzy graphs with applications SpringerPlus 5 1 2016 2104 10.1186/s40064-016-3783-z
13 Ghorai G. Pal M. Certain types of product bipolar fuzzy graphs Int. J. Appl. Comput. Math. 3 2 2017 605 619 10.1007/s40819-015-0112-0
14 Gutman I. Trinajstic N. Graph theorem and molecular orbitals. Total π-electron energy of alternant hydrocarbons Chem. Phys. Lett. 17 4 1972 535 538
15 Gutman I. Ruscic B. Trinajstic N. Wilcox C.F. Graph theory and molecular orbitals. XII. Acyclic polyenes J. Chem. Phys. 62 1975 3399 3405
16 Gutman I. A formula for the Wiener number of trees and its extension to graphs containing cycles Graph Theory Notes New York vol. 27 1994 9 15
17 Hosoya H. Topological index. A newly proposed quantity characterizing the topological nature of structural isomers of saturated hydrocarbons Bull. Chem. Soc. Jpn. 44 9 1971 2332 2339
18 Islam S.R. Pal M. First Zagreb index on a fuzzy graph and its application J. Intell. Fuzzy Syst. 40 6 2021 10575 10587
19 Islam S.R. Pal M. Hyper-Wiener index for fuzzy graph and its application in share market J. Intell. Fuzzy Syst. 41 1 2021 2073 2083
20 Islam S.R. Pal M. F-index for fuzzy graph with application TWMS J. Appl. Eng. Math. 13 2 2023 517 530
21 Islam S.R. Pal M. Hyper-connectivity index for fuzzy graph with application TWMS J. Appl. Eng. Math. 13 3 2023 920 936
22 Islam S.R. Pal M. Second Zagreb index for fuzzy graphs and its application in mathematical chemistry Iran. J. Fuzzy Syst. 20 1 2023 119 136
23 Islam S.R. Pal M. Multiplicative version of first Zagreb index in fuzzy graph and its application in crime analysis Proc. Natl. Acad. Sci. India Sect. A Phys. Sci. 94 1 2024 127 141
24 Jauhari M.N. Ali F. Survey on topological indices and graphs associated with a commutative ring J. Phys.: Conf. Ser, IOP Publishing 1562 1 2020 012008
25 Kalathian S. Ramalingam S. Raman S. Srinivasan N. Some topological indices in fuzzy graphs J. Intell. Fuzzy Syst. 39 5 2020 6033 6046
26 Khadikar P.V. Karmarkar S. Agrawal V.K. A novel PI index and its applications to QSPR/QSAR studies J. Chem. Inf. Comput. Sci. 41 4 2001 934 949 11500110
27 Lee K.M. Lee K.M. Cios K.J. Comparison of interval-valued fuzzy sets, intuitionistic fuzzy sets, and bipolar-valued fuzzy sets Computing and Information Technologies: Exploring Emerging Technologies 2001 433 439
28 Liaqat S. Mufti Z.S. Shang Y. Newly defined fuzzy Misbalance Prodeg Index with application in multi-criteria decision-making AIMS Math. 9 8 2024 20193 20220
29 Mahapatra R. Samanta S. Pal M. Xin Q. RSM index: a new way of link prediction in social networks J. Intell. Fuzzy Syst. 37 2 2019 2137 2151
30 Mahapatra R. Samanta S. Pal M. Applications of edge colouring of fuzzy graphs Informatica 31 2 2020 313 330 10.15388/20-INFOR403
31 Mondal S. De N. Pal A. Multiplicative degree based topological indices of nanostar dendrimers Biointerface Res. Appl. Chem. 11 1 2021 7700 7711
32 Mondal S. Barik S. De N. Pal A. A note on neighborhood first Zagreb energy and its significance as a molecular descriptor Chemom. Intell. Lab. Syst. 222 2022 104494
33 Mondal U. Mahapatra T. Xin Q. Pal M. Solution of road network problem with the help of m-polar fuzzy graph using isometric and antipodal concept Sci. Rep. 13 1 2023 6452 37081040
34 Mondal U. Mahapatra T. Xin Q. Pal M. Generalized m-polar fuzzy planar graph and its application IEEE Access 11 2023 138399 138413
35 Mondal U. Pal M. Das K. Interval-valued intuitionistic fuzzy soft graphs with application TWMS J. Appl. Eng. Math. 14 1 2024 1 18
36 Nagoorgani A. Hussain R.J. Fuzzy effective distance k-dominating sets and their applications Int. J. Algorithms Comput. Math. 2 3 2009 25 36
37 Mufti Z.S. Fatima E. Anjum R. Tchier F. Xin Q. Hossain M.M. Computing first and second fuzzy Zagreb indices of linear and multiacyclic hydrocarbons Fuzzy Sets Appl. Math. 2022 10.1155/2022/6281592
38 Naeem T. Gumaei A. Jamil M.K. Alsanad A. Ullah K. Connectivity Indices of Intuitionistic Fuzzy Graphs and Their Applications in Internet Routing and Transport Network Flow. Generalised Fuzzy Models Applied to Logical Algebras and Intelligent Systems in Engineering https://doi.org/10.1155/2021/4156879 2021
39 Nazeer I. Rashid T. Hussain M.T. Cyclic connectivity index of fuzzy incidence graphs with applications in the highway system of different cities to minimize road accidents and in a network of different computers PLoS ONE 2021 10.1371/journal.pone.0257642
40 Pal M. Samanta S. Ghorai G. Modern Trends in Fuzzy Graph Theory 2020 Springer Singapore 10.1007/978-981-15-8803-7
41 Pramanik T. Pal M. Mondal S. Interval-valued fuzzy threshold graphs Pac. Sci. Rev. A, Nat. Sci. Eng. 18 2016 66 71
42 Pramanik T. Samanta S. Pal M. Mondal S. Sarkar B. Interval-valued fuzzy phi-tolerance competition graphs SpringerPlus 5 2016 1981 27917352
43 Pramanik T. Samanta S. Pal M. Interval-valued fuzzy planar graphs Int. J. Mach. Learn. Cybern. 7 6 2016 653 664
44 Randic M. Characterization of molecular branching J. Am. Chem. Soc. 97 23 1975 6609 6615
45 Randic M. Novel molecular descriptor for structure-property studies Chem. Phys. Lett. 211 10 1993 478 483
46 Rashmanlou H. Samanta S. Pal M. Borzooei R.A. Product of bipolar fuzzy graphs and their degree Int. J. Gen. Syst. 45 1 2016 1 14
47 Rashmanlou H. Muhiuddin G. Amanathulla S.K. Mofidnakhaei F. Pal M. A study on cubic graphs with novel application J. Intell. Fuzzy Syst. 40 1 2021 89 101 10.3233/JIFS-182929
48 Rosenfeld A. Fuzzy graphs Zadeh L.A. Fu K.S. Shimura M. Fuzzy Sets and Their Applications 1975 Academic Press New York 77 95
49 Rosyida I. Widodo W. Indrati C.R. Sugeng A.K. A new approach for determining fuzzy chromatic number of fuzzy graph J. Intell. Fuzzy Syst. 28 2015 2331 2341
50 Saha A. Pal M. Pal T.K. Selection of programme slots of television channels for giving advertisement: a graph theoretic approach Inf. Sci. 177 12 2007 2480 2492 10.1016/j.ins.2007.01.015
51 Sababheh M. Graph indices via the AM-GM inequality Discrete Appl. Math. 230 2017 100 111
52 Samanta S. Sarkar B. Shin D. Pal M. Completeness and regularity of generalized fuzzy graphs SpringerPlus 5 1 2016 1979 10.1186/s40064-016-3558-6
53 Sahoo S. Pal M. Rashmanlou H. Borzooei R.A. Covering and paired domination in intuitionistic fuzzy graphs J. Intell. Fuzzy Syst. 33 6 2017 4007 4015 10.3233/JIFS-17848
54 Sahoo S. Pal M. Intuitionistic fuzzy competition graphs J. Appl. Math. Comput. 52 2015 37 57
55 Sahoo S. Pal M. Intuitionistic fuzzy tolerance graphs with application J. Appl. Math. Comput. 55 2017 495 511
56 Samanta S. Pal M. Fuzzy k-competition graphs and p-competitions fuzzy graphs Fuzzy Inf. Eng. 5 2 2013 191 204
57 Sunitha S.M. Vijayakumar A. Complement of a fuzzy graph Indian J. Pure Appl. Math. 33 9 2002 1451 1464
58 Tajdin A. Mahdavi I. Mahdavi-Amiri N. Gildeh B.S. Computing a fuzzy shortest path in a network with mixed fuzzy arc lengths using α-cuts Comput. Math. Appl. 60 4 2010 989 1002
59 Wiener H. Structural determination of paraffin boiling points J. Am. Chem. Soc. 69 1947 17 20 20291038
60 Zadeh L.A. Fuzzy sets Inf. Control 8 1965 338 353
