Next Article in Journal
An Interval Type 2 Fuzzy Decision-Making Framework for Exploring Critical Issues for the Sustenance of the Tea Industry
Next Article in Special Issue
Neighbor Distinguishing Colorings of Graphs with the Restriction for Maximum Average Degree
Previous Article in Journal
Using the Ordered Weighted Average Operator to Gauge Variation in Agriculture Commodities in India
Previous Article in Special Issue
Equitable Coloring of IC-Planar Graphs with Girth g ≥ 7
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Analysis of the Zagreb Indices over the Weakly Zero-Divisor Graph of the Ring Zp×Zt×Zs

1
Department of Mathematics, Aligarh Muslim University, Aligarh 202002, India
2
Department of Mathematical Sciences, College of Science, Princess Nourah bint Abdulrahman University, P.O. Box 84428, Riyadh 11671, Saudi Arabia
3
School of Basic and Applied Sciences, Faculty of Science and Technology, JSPM University, Pune 412207, India
*
Author to whom correspondence should be addressed.
These authors contributed equally to this work.
Axioms 2023, 12(10), 987; https://doi.org/10.3390/axioms12100987
Submission received: 5 September 2023 / Revised: 7 October 2023 / Accepted: 16 October 2023 / Published: 18 October 2023
(This article belongs to the Special Issue Recent Advances in Graph Theory with Applications)

Abstract

:
Let R be a commutative ring with identity, and  Z ( R )  be the set of zero-divisors of R. The weakly zero-divisor graph of R denoted by  W Γ ( R )  is an undirected (simple) graph with vertex set  Z ( R ) * , and two distinct vertices x and y are adjacent, if and only if there exist  r a n n ( x )  and  s a n n ( y ) , such that  r s = 0 . Importantly, it is worth noting that  W Γ ( R )  contains the zero-divisor graph  Γ ( R )  as a subgraph. It is known that graph theory applications play crucial roles in different areas one of which is chemical graph theory that deals with the applications of graph theory to solve molecular problems. Analyzing Zagreb indices in chemical graph theory provides numerical descriptors for molecular structures, aiding in property prediction and drug design. These indices find applications in QSAR modeling and chemical informatics, contributing to efficient compound screening and optimization. They are essential tools for advancing pharmaceutical and material science research. This research article focuses on the basic properties of the weakly zero-divisor graph of the ring  Z p × Z t × Z s , denoted by  W Γ ( Z p × Z t × Z s ) , where p, t, and s are prime numbers that may not necessarily be distinct and greater than 2. Moreover, this study includes the examination of various indices and coindices such as the first and second Zagreb indices and coindices, as well as the first and second multiplicative Zagreb indices and coindices of  W Γ ( Z p × Z t × Z s ) .

1. Introduction

The exploration of graphs linked with algebraic structures has gained significant momentum as a rapidly evolving field. A key focus lies in the classification of graphs corresponding to algebraic structures and the reciprocal endeavor of attributing algebraic properties to these graphs. Researchers are particularly intrigued by unraveling the intricate interplay between the inherent algebraic characteristics of well-known entities and the graph-theoretic attributes exhibited by analogous graphs. A specific instance of this is the zero-divisor graph associated with a commutative ring R, which bears a unity element denoted by 1 (distinct from 0). This graph, denoted as  Γ ( R ) , is constructed by representing the elements of the ring R as its vertices. Notably, the connectivity between these vertices is established based on a distinct rule: two vertices, namely u and v, are deemed adjacent within the graph solely when the product of these elements,  u v , equals zero. This conceptual framework creates an intriguing bridge between the algebraic nature of the ring R and the graph-theoretic structure of  Γ ( R ) , exemplifying the broader trend of intertwining algebra and graph theory. This concept was originally introduced by Beck [1], subsequently modified by Anderson and Livingston [2] to only consider the nonzero zero-divisors of R as vertices. This graph-theoretical concept provides a way to study the properties of commutative rings and their zero-divisors, with potential applications in diverse fields such as algebraic geometry, algebraic topology, and coding theory. The zero-divisor graph of R have been extensively studied by various researchers, as seen in several literature contributions cited in references [3,4,5,6,7,8,9,10,11]. Several research studies have explored the characteristics of zero-divisor graphs over finite commutative rings. Sharma et al. [12] focused on the adjacency matrices of these graphs for the ring  Z p × Z p , where p is a prime. The contributions of Akgüneş et al. [13], Aykaç and Akgüneş (2020), and Akgüneş and Nacaroğlu (2018) have investigated the graph-theoretical properties of zero-divisor graphs. These graphs are constructed from different rings, such as  Z p × Z q Z p 2 × Z q 2 , and   Z p × Z q × Z r , where p, q, and r are primes. These studies have analyzed various fundamental features of these zero-divisor graphs, including their graph-theoretical properties, topological indices, and other structural characteristics. These investigations provide insights into the behavior and properties of these graphs and their relationship to the underlying algebraic structures. Mohammad et al. [14] proposed a novel concept known as the weakly zero-divisor graph, denoted by  W Γ ( R ) . This graph is defined based on the nonzero zero-divisors of a ring R, where each vertex of the graph corresponds to a nonzero zero-divisor of R. The graph is constructed such that two vertices u and v are adjacent, if and only if there exist elements  r a n n ( u ) *  and  s a n n ( v ) * , where  a n n ( u )  represents the set of elements in R that annihilate u. The graph  Γ ( R )  is a subgraph of  W Γ ( R )  that covers the entire graph. It is noteworthy that this concept provides a new way to study the properties of rings and the relationships between their zero-divisors.
Chemical graph theory is an active area of research in recent times. In this field, researchers study the structures of chemical compounds with the aid of graph theory and mathematics. The most important concept in chemical graph theory is topological indices. Topological indices are numeric values that are associated with graphs that remain invariant under graph automorphisms. In fact, topological indices in graph theory are numerical measures that capture the structural and connectivity properties of graphs. They have a wide range of applications in the field of chemistry, biology, and medicine. In particular, they help in the study of certain physical characteristics of chemical compounds such as the boiling point, ash point, density, stability, and many more. They also serve as powerful tools to execute biological network analysis, and also to determine the physical features and the chemical reactions associated with various drugs without having to carry out the actual experiment, for instance, see [15,16].
Taking motivation from the above cited work, in this research article, we examine the characteristics of the weakly zero-divisor graph of the ring  Z p × Z t × Z s , using p, t, and s as prime numbers that are not necessarily distinct and greater than 2. We focus on analyzing its degree sequence, irregularity index, and maximum and minimum degree. Additionally, we explore various topological indices, including the first and second Zagreb indices, first and second Zagreb coindices, first and second multiplicative Zagreb indices, and first and second multiplicative Zagreb coindices index of  W Γ ( Z p × Z t × Z s ) . Before delving into this, it is essential to revisit some fundamental graph theory definitions. By establishing a solid foundation in graph theory, we can then seamlessly delve into our investigation, leveraging these innovative graph lenses to unveil previously hidden structural characteristics within finite commutative rings.

2. Preliminaries

Let  G = ( V , E )  denote a simple graph with  V ( G )  as the vertex set and  E ( G )  as the edge set.  | V ( G ) |  and  | E ( G ) |  are referred to be the order and size of the graph, respectively.  P n  and  C n  denotes the path and cycle on n vertices.  K n  and  K m , n  depicts the complete graph and complete bipartite graph respectively. If  u v  is an edge of G, then u and v are said to be adjacent in G, and we write  u v ; otherwise  u v . Given a graph  G ( V , E )  with  v V ( G ) , then  d e g ( v )  denotes the  d e g r e e  of vertex v in G and is defined as the number of vertices adjacent to it. The designations for the lowest and highest degrees are  δ ( G )  and  Δ ( G ) , respectively. The distance between two vertices  u , v V ( G ) , denoted by  d ( u , v ) , is the number of edges on the shortest path between them in G. The degree sequence of an undirected graph denoted by  D S ( G )  is the list of degrees of all the vertices of the graph. Usually, we list the degrees in non-increasing order, that is from the largest degree to the smallest degree. The degree sequence is a graph invariant; so, isomorphic graphs have the same degree sequence. Also, the irregularity index  t ( G )  of a graph represents the number of different values present in the degree sequence of the graph. In other words, it counts how many unique degrees are assigned to the vertices of the graph. For any undefined notations and terminology, we refer the reader to [17].
Zagreb indices are topological indices that provide information about the degree-based structural characteristics of a graph. Some of the Zagreb indices are defined as follows:
Definition 1 
([18]). The Zagreb group indices of a graph G denoted by  M 1 ( G )  (first Zagreb index) and  M 2 ( G )  (second Zagreb index) is defined as:
M 1 ( G ) = u V ( G ) d 2 ( u )
and
M 2 ( G ) = u v E ( G ) d ( u ) d ( v ) ,
where  d ( u )  and  d ( v )  stand for the degrees of the distinct vertices u and v, respectively.
Definition 2 
([19]). The Zagreb group of coindices of a graph G denoted by  M 1 ¯ ( G )  (first Zagreb coindex) and  M 2 ¯ ( G )  (second Zagreb coindex) is defined as:
M 1 ¯ ( G ) = u v E ( G ) [ d ( u ) + d ( v ) ]
and
M 2 ¯ ( G ) = u v E ( G ) [ d ( u ) d ( v ) ] ,
where  d ( u )  and  d ( v )  stand for the degrees of the distinct vertices u and u, respectively.
Definition 3 
([20]). The Multiplicative Zagreb group of indices of a graph G denoted by  1 ( G )  (first multiplicative Zagreb index) and  2 ( G )  (second multiplicative Zagreb index) is defined as:
1 ( G ) = u V ( G ) d ( u ) 2
and
2 ( G ) = u v E ( G ) [ d ( u ) d ( v ) ] ,
where  d ( u )  and  d ( v )  stand for the degree of the distinct vertices u and v, respectively.
Definition 4 
([21]). The Multiplicative Zagreb group of coindices of a graph G denoted by  ¯ 1 ( G )  (first multiplicative Zagreb coindex) and  ¯ 2 ( G )  (second multiplicative Zagreb coindex) is defined as:
¯ 1 ( G ) = u v E ( G ) [ d ( u ) + d ( v ) ]
and
¯ 2 ( G ) = u v E ( G ) [ d ( u ) d ( v ) ] ,
where  d ( u )  and  d ( v )  denote the degree of the distinct vertices u and  v 1 , respectively.
This research article aims to investigate various properties and some topological indices related to this graph. In the Section 1, the article discusses the fundamental properties of the weakly zero-divisor graph of the ring  W Γ ( Z p × Z t × Z s ) , including the adjacency relations between vertices, the degree of each vertex, the degree sequence, the maximum and minimum degrees, and the irregularity index. In the Section 2, the research focuses on Zagreb indices and coindices within the context of  W Γ ( Z p × Z t × Z s ) . Specifically, it explores the first and second Zagreb indices and coindices, as well as the first and second multiplicative Zagreb indices and coindices. The Section 5 contains the conclusions. Overall, the article delves into both the structural properties of the graph and its algebraic characteristics, providing a comprehensive understanding of this specific ring and its associated weakly zero-divisor graph.

3. Properties of  W Γ ( Z p × Z t × Z s )

This section is dedicated to outlining several foundational properties of  W Γ ( Z p × Z t × Z s ) , starting with the definition of adjacent and nonadjacent vertices. Before delving into this, it is necessary to state a lemma that is used in our subsequent discussion.
Lemma 1. 
If u and v are adjacent in  Γ ( R ) , for distinct  u , v Z ( R ) * , then u and v are also adjacent in  W Γ ( R ) .
Proof. 
Suppose that u and v are adjacent in  Γ ( R ) , for distinct vertices  u , v Z ( R ) * . Thus,  u v = 0 , and clearly  u a n n ( v )  and  v a n n ( u ) . Hence, u and v are also adjacent in  W Γ ( R ) . □
Definition 5. 
The adjacent and nonadjacent vertices of  W Γ ( Z p × Z t × Z s )  are as follows:
(i) 
( x i , 0 , 0 )  ∼  ( 0 , y j , 0 ) , where  0 x i Z p  and  0 y j Z t ,
(ii) 
( x i , 0 , 0 )  ∼  ( 0 , 0 , d k ) , where  0 x i Z p  and  0 d k Z s ,
(iii) 
( x i , 0 , 0 )  ∼  ( 0 , y j , d k ) , where  0 x i Z p 0 y j Z t , and  0 d k Z s ,
(iv) 
( x i , 0 , 0 )  ∼  ( x i , 0 , 0 ) , where  0 x i , x i Z p  and  x i x i ,
(v) 
( x i , 0 , 0 )  ∼  ( x i , y j , 0 ) , where  0 x i Z p  and  0 y j Z t ,
(vi) 
( x i , 0 , 0 )  ∼  ( x i , 0 , d k ) , where  0 x i Z p  and  0 d k Z s ,
(vii) 
( 0 , y j , 0 )  ∼  ( 0 , 0 , d k ) , where  0 y j Z t  and  0 d k Z s ,
(viii) 
( 0 , y j , 0 )  ∼  ( x i , 0 , d k ) , where  0 x i Z p 0 y j Z t , and  0 d k Z s ,
(ix) 
( 0 , y j , 0 )  ∼  ( 0 , y j , d k ) , where  0 y j Z t  and  0 d k Z s ,
(x) 
( 0 , y j , 0 )  ∼  ( x i , y j , 0 ) , where  0 x i Z p  and  0 y j Z t ,
(xi) 
( 0 , y j , 0 )  ∼  ( 0 , y j , 0 ) , where  0 y j , y j Z t  and  y j y j ,
(xii) 
( 0 , 0 , d k )  ∼  ( x i , y j , 0 ) , where  0 x i Z p 0 y j Z t , and  0 d k Z s ,
(xiii) 
( 0 , 0 , d k )  ∼  ( x i , 0 , d k ) , where  0 x i Z p  and  0 d k Z s ,
(xiv) 
( 0 , 0 , d k )  ∼  ( 0 , y j , d k ) , where  0 y j Z t  and  0 d k Z s ,
(xv) 
( 0 , 0 , d k )  ∼  ( 0 , 0 , d k ) , where  0 d k , d k Z s  and  d k d k ,
(xvi) 
( x i , 0 , d k )  ∼  ( x i , y j , 0 ) , where  0 x i Z p 0 y j Z t , and  0 d k Z s ,
(xvii) 
( x i , 0 , d k )  ∼  ( 0 , y j , d k ) , where  0 x i Z p 0 y j Z t , and  0 d k Z s ,
(xviii) 
( x i , y j , 0 )  ∼  ( 0 , y j , d k ) , where  0 x i Z p 0 y j Z t , and  0 d k Z s ,
(xix) 
( x i , y j , 0 ) ( x i , y j , 0 ) , where  x i x i  or  y j y j , with  0 x i , x i Z p  and  0 y j , y j Z t ,
(xx) 
( x i , 0 , d k ) ( x i , 0 , d k ) , where  x i x i  or  d k d k , with  0 x i , x i Z p  and  0 d k , d k Z s ,
(xxi) 
( 0 , y j , d k ) ( 0 , y j , d k ) , where  y j y j  or  d k d k , with  0 y j , y j Z t  and  0 d k d k Z s .
The following result shows the calculation of the degree for each vertex in the graph  W Γ ( Z p × Z t × Z s ) . This means that the number of edges connected to each possible vertex in the graph has been determined.
Theorem 1. 
The graph  W Γ ( Z p × Z t × Z s )  exhibits vertex degrees that are given by
(1) 
d e g ( x i , 0 , 0 ) = p t + t s + s p p t s 1 , where  0 x i Z p ,
(2) 
d e g ( 0 , y j , 0 ) = p t + t s + s p p t s 1 , where  0 y j Z t ,
(3) 
d e g ( 0 , 0 , d k ) = p t + t s + s p p t s 1 , where  0 d k Z s ,
(4) 
d e g ( x i , y j , 0 ) = p s + t s s 1 , where  0 x i Z p  and  0 y j Z t ,
(5) 
d e g ( 0 , y j , d k ) = p s + p t p 1 , where  0 y j Z t  and  0 d k Z s ,
(6) 
d e g ( x i , 0 , d k ) = p t + t s t 1 , where  0 x i Z p  and  0 d k Z s .
Proof. 
( 1 )  We have  ( x i , 0 , 0 ) · ( 0 , y j , d k ) = ( 0 , 0 , 0 )  for  0 x i Z p 0 y j Z t  and  0 d k Z s , which implies  ( x i , 0 , 0 ) ( 0 , y j , d k )  in  Γ ( Z p × Z t × Z s ) . So, by Lemma 1,  ( x i , 0 , 0 ) ( 0 , y j , d k )  in  W Γ ( Z p × Z t × Z s ) . Similarly, for   0 x i Z p  and  0 y j Z t ( x i , 0 , 0 )  ∼  ( 0 , y j , 0 )  in  Γ ( Z p × Z t × Z s )  as  ( x i , 0 , 0 ) · ( 0 , y j , 0 ) = ( 0 , 0 , 0 ) . Thus, by Lemma 1,  ( x i , 0 , 0 )  ∼  ( 0 , y j , 0 )  in  W Γ ( Z p × Z t × Z s ) . Also,  ( x i , 0 , 0 )  ∼  ( 0 , 0 , d k )  as  ( x i , 0 , 0 ) · ( 0 , 0 , d k ) = ( 0 , 0 , 0 )  for  0 x i Z p  and  0 d k Z s ; then, by Lemma 1,  ( x i , 0 , 0 )  ∼  ( 0 , 0 , d k )  in  W Γ ( Z p × Z t × Z s ) . Further,  ( x i , 0 , 0 )  ∼  ( x i , 0 , d k )  because there exists  x = ( 0 , 0 , 1 )   a n n ( x i , 0 , 0 ) *  and  y = ( 0 , 1 , 0 )   a n n ( x i , 0 , d k ) * , such that  x y = 0 . Moreover,  ( x i , 0 , 0 )  ∼  ( x i , y j , 0 ) , as there exist  x = ( 0 , 1 , 0 )   a n n ( x i , 0 , 0 ) *  and  y = ( 0 , 0 , 1 )   a n n ( x i , y j , 0 ) * , such that  x y = 0 . Again,  ( x i , 0 , 0 )  ∼  ( x i , 0 , 0 ) 0 x i , x i Z p , and  x i x i , since there exist  x = ( 0 , 1 , 0 )   a n n ( x i , 0 , 0 ) *  and  y = ( 0 , 0 , 1 )   a n n ( x i , 0 , 0 ) * , such that  x y = 0 . Hence, the degree of the vertex  ( x i , 0 , 0 )  becomes
d e g ( x i , 0 , 0 ) = ( t 1 ) ( s 1 ) + ( t 1 ) + ( s 1 ) + ( p 1 ) ( s 1 ) + ( p 1 ) ( t 1 ) + ( p 2 ) = p t + t s + s p p t s 1 .
( 2 ) ( 0 , y j , 0 ) ( x i , 0 , 0 )  in  Γ ( Z p × Z t × Z s )  as  ( 0 , y j , 0 ) · ( x i , 0 , 0 ) = ( 0 , 0 , 0 )  for  0 x i Z p 0 y j Z t . Therefore, they are adjacent in  W Γ ( Z p × Z t × Z s )  by Lemma 1. Similarly, for   0 y j Z t  and  0 d k Z s ( 0 , y j , 0 ) ( 0 , 0 , d k ) , since  ( 0 , y j , 0 ) · ( 0 , 0 , d k ) = ( 0 , 0 , 0 ) . Hence, by Lemma 1,  ( 0 , y j , 0 ) ( 0 , 0 , d k )  in  W Γ ( Z p × Z t × Z s ) . Also,  ( 0 , y j , 0 ) ( x i , 0 , d k ) , as  ( 0 , y j , 0 ) · ( x i , 0 , d k ) = ( 0 , 0 , 0 )  for  0 x i Z p  and  0 y j Z t 0 d k Z s . Therefore,  ( 0 , y j , 0 ) ( x i , 0 , d k )  in  W Γ ( Z p × Z t × Z s )  by Lemma 1. Further,  ( 0 , y j , 0 ) ( 0 , y j , d k ) , because there exist  x = ( 0 , 0 , 1 ) a n n ( 0 , y j , 0 ) *  and  y = ( 1 , 0 , 0 ) a n n ( 0 , y j , d k ) * , such that  x y = 0 . Moreover,  ( 0 , y j , 0 ) ( x i , y j , 0 ) , since there exist  x = ( 1 , 0 , 0 ) a n n ( 0 , y j , 0 ) *  and  y = ( 0 , 0 , 1 ) a n n ( x i , y j , 0 ) * , such that  x y = 0 . Finally,  ( 0 , y j , 0 ) ( 0 , y j , 0 ) , because there exist  x = ( 1 , 0 , 0 ) a n n ( 0 , y j , 0 ) *  and  y = ( 0 , 0 , 1 ) a n n ( 0 , y j , 0 ) * , such that  x y = 0 , for  0 y j , y j Z t  and  y j y j . Hence, the degree of the vertex  ( 0 , y j , 0 )  becomes
d e g ( 0 , y j , 0 ) = ( p 1 ) + ( s 1 ) + ( p 1 ) ( s 1 ) + ( t 1 ) ( s 1 ) + ( p 1 ) ( t 1 ) + ( t 2 ) = p t + t s + s p p t s 1 .
( 3 )  We have  ( 0 , 0 , d k ) ( x i , 0 , 0 ) , because  ( 0 , 0 , d k ) · ( x i , 0 , 0 ) = ( 0 , 0 , 0 )  for  0 x i Z p 0 d k Z s . Therefore, they are adjacent in both  Γ ( Z p × Z t × Z s )  and  W Γ ( Z p × Z t × Z s )  by Lemma 1. Similarly,  ( 0 , 0 , d k ) · ( 0 , y j , 0 ) = ( 0 , 0 , 0 )  for  0 y j Z t  and  0 d k Z s ; so,  ( 0 , 0 , d k ) ( 0 , y j , 0 )  in  W Γ ( Z p × Z t × Z s ) , by Lemma 1. Also,  ( 0 , 0 , d k ) ( x i , y j , 0 ) , for  0 x i Z p 0 y j Z t , and  0 d k Z s , because there exist  x = ( 1 , 0 , 0 ) a n n ( 0 , 0 , d k ) *  and  y = ( 0 , 1 , 0 ) a n n ( x i , y j , 0 ) * , such that  x y = 0 . Further, for  0 x i Z p  and  0 d k Z s ( 0 , 0 , d k ) ( x i , 0 , d k ) , since there exist  x = ( 1 , 0 , 0 ) a n n ( 0 , 0 , d k ) *  and  y = ( 0 , 1 , 0 ) a n n ( x i , 0 , d k ) * , such that  x y = 0 . Similarly  ( 0 , 0 , d k ) ( 0 , y j , d k )  as there exists  x = ( 0 , 1 , 0 ) a n n ( 0 , 0 , d k ) *  and  y = ( 1 , 0 , 0 ) a n n ( 0 , y j , d k ) *  such that  x y = 0 . Finally,  ( 0 , 0 , d k ) ( 0 , 0 , d k )  for  0 d k , d k Z s  and  d k d k , because there exist  x = ( 0 , 1 , 0 ) a n n ( 0 , 0 , d k ) *  and  y = ( 1 , 0 , 0 ) a n n ( 0 , 0 , d k ) * , such that  x y = 0 . This implies that the degree of the vertex  ( 0 , 0 , d k )  becomes
d e g ( 0 , 0 , d k ) = ( p 1 ) + ( t 1 ) + ( p 1 ) ( t 1 ) + ( p 1 ) ( s 1 ) + ( t 1 ) ( s 1 ) + ( s 2 ) = p t + t s + s p p t s 1 .
( 4 )  For  0 x i Z p 0 y j Z t , and  0 d k Z s , we have  ( x i , y j , 0 ) ( 0 , 0 , d k )  as  ( x i , y j , 0 ) · ( 0 , 0 , d k ) = ( 0 , 0 , 0 ) . Therefore, by Lemma 1,  ( x i , y j , 0 ) ( 0 , 0 , d k )  in  W Γ ( Z p × Z t × Z s ) . Further,  ( x i , y j , 0 ) ( x i , 0 , 0 ) , because there exist  x = ( 0 , 0 , 1 ) a n n ( x i , y j , 0 ) *  and  y = ( 0 , 1 , 0 ) a n n ( x i , 0 , 0 ) * , such that  x y = 0 . Similarly,  ( x i , y j , 0 ) ( 0 , y j , 0 ) , since there exist  x = ( 0 , 0 , 1 ) a n n ( x i , y j , 0 ) *  and  y = ( 1 , 0 , 0 ) a n n ( 0 , y j , 0 ) * , such that  x y = 0 . Also,  ( x i , y j , 0 ) ( x i , 0 , d k )  in  W Γ ( Z p × Z t × Z s ) , because there exist  x = ( 0 , 0 , 1 ) a n n ( x i , y j , 0 ) *  and  y = ( 0 , 1 , 0 ) a n n ( x i , 0 , d k ) * , such that  x y = 0 . Finally,  ( x i , y j , 0 ) ( 0 , y j , d k ) , since there exist  x = ( 0 , 0 , 1 ) a n n ( x i , y j , 0 ) *  and  y = ( 1 , 0 , 0 ) a n n ( 0 , y j , d k ) * , such that  x y = 0 . Hence, the degree of the vertex  ( x i , y j , 0 )  becomes
d e g ( x i , y j , 0 ) = ( s 1 ) + ( p 1 ) + ( t 1 ) + ( p 1 ) ( s 1 ) + ( t 1 ) ( s 1 ) = p s + t s s 1 .
( 5 )  For  0 x i Z p 0 y j Z t , and  0 d k Z s , we have  ( 0 , y j , d k ) ( x i , 0 , 0 )  as  ( 0 , y j , d k ) · ( x i , 0 , 0 ) = ( 0 , 0 , 0 ) . Therefore, by Lemma 1, adjacency is also followed in  W Γ ( Z p × Z t × Z s ) . Also,  ( 0 , y j , d k ) ( 0 , y j , 0 ) , because there exist  x = ( 1 , 0 , 0 ) a n n ( 0 , y j , d k ) *  and  y = ( 0 , 0 , 1 ) a n n ( 0 , y j , 0 ) * , such that  x y = 0 . Similarly,  ( 0 , y j , d k ) ( 0 , 0 , d k ) , since there exist  x = ( 1 , 0 , 0 ) a n n ( 0 , y j , d k ) *  and  y = ( 0 , 1 , 0 ) a n n ( 0 , 0 , d k ) * , such that  x y = 0 . Further,  ( 0 , y j , d k ) ( x i , 0 , d k )  in  W Γ ( Z p × Z t × Z s ) , since there exist  x = ( 1 , 0 , 0 ) a n n ( 0 , y j , d k ) *  and  y = ( 0 , 1 , 0 ) a n n ( x i , 0 , d k ) * , such that  x y = 0 . Finally,  ( 0 , y j , d k ) ( x i , y j , 0 )  in  W Γ ( Z p × Z t × Z s ) , because there exist  x = ( 1 , 0 , 0 ) a n n ( 0 , y j , d k ) *  and  y = ( 0 , 0 , 1 ) a n n ( 0 , y j , d k ) * , such that  x y = 0 . Hence, the degree of the vertex  ( 0 , y j , d k )  becomes
d e g ( 0 , y j , d k ) = ( p 1 ) + ( t 1 ) + ( s 1 ) + ( p 1 ) ( s 1 ) + ( p 1 ) ( t 1 ) = p s + p t p 1 .
( 6 )  For  0 x i Z p 0 y j Z t , and  0 d k Z s , we have  ( x i , 0 , d k ) ( x i , 0 , 0 )  in  W Γ ( Z p × Z t × Z s ) , since there exist  x = ( 0 , 1 , 0 ) a n n ( x i , 0 , d k ) *  and  y = ( 0 , 0 , 1 ) a n n ( x i , 0 , 0 ) * , such that  x y = 0 . Also,  ( x i , 0 , d k ) ( 0 , y j , 0 )  as  ( x i , 0 , d k ) · ( 0 , y j , 0 ) = ( 0 , 0 , 0 ) . So, by using Lemma 1,  ( x i , 0 , d k ) ( 0 , y j , 0 )  in  W Γ ( Z p × Z t × Z s ) . Further,  ( x i , 0 , d k ) ( 0 , 0 , d k ) , because there exist  x = ( 0 , 1 , 0 ) a n n ( x i , 0 , d k ) *  and  y = ( 1 , 0 , 0 ) a n n ( 0 , 0 , d k ) * , such that  x y = 0 . Moreover,  ( x i , 0 , d k ) ( x i , y j , 0 ) , since there exist  x = ( 0 , 1 , 0 ) a n n ( x i , 0 , d k ) *  and  y = ( 0 , 0 , 1 ) a n n ( x i , y j , 0 ) * , such that  x y = 0 . Finally,  ( x i , 0 , d k ) ( 0 , y j , d k ) , as there exist  x = ( 0 , 1 , 0 ) a n n ( x i , 0 , d k ) *  and  y = ( 0 , 0 , 1 ) a n n ( 0 , y j , d k ) * , such that  x y = 0 . Hence, the degree of the vertex  ( x i , 0 , d k )  becomes
d e g ( x i , 0 , d k ) = ( p 1 ) + ( t 1 ) + ( s 1 ) + ( p 1 ) ( t 1 ) + ( t 1 ) ( s 1 ) = p t + t s t 1 .
Theorem 2. 
The maximum degree of the graph  W Γ ( Z p × Z t × Z s )  is given by
Δ ( W Γ ( Z p × Z t × Z s ) ) = p t + t s + s p p t s 1 .
Proof. 
In view of Theorem 1, we have  d e g ( x i , 0 , 0 ) = d e g ( 0 , y j , 0 ) = d e g ( 0 , 0 , d k ) = p t + t s + s p p t s 1 . Also,  d e g ( x i , y j , 0 ) = p s + t s s 1 d e g ( 0 , y j , d k ) = p s + p t p 1 , and  d e g ( x i , 0 , d k ) = p t + t s t 1 , where  0 a Z p 0 b Z t  and  0 c Z s . Hence, the maximum degree of the graph  W Γ ( Z p × Z t × Z s )  is
Δ ( W Γ ( Z p × Z t × Z s ) ) = p t + t s + s p p t s 1 .
Example 1. 
The maximum degree of the graph  W Γ ( Z 3 × Z 3 × Z 3 )  is given by  Δ ( W Γ ( Z 3 × Z 3 × Z 3 ) ) = 3 × 3 + 3 × 3 + 3 × 3 3 3 3 1 = 17 . The verification is also shown in Example 3.
Theorem 3. 
The minimum degree of the graph  W Γ ( Z p × Z t × Z s )  is given by
δ ( W Γ ( Z p × Z t × Z s ) ) = m i n { p s + t s s 1 , p s + p t p 1 , p t + t s t 1 } .
Proof. 
By employing Theorem 1, we obtain  d e g ( x i , y j , 0 ) = p s + t s s 1 d e g ( 0 , y j , d k ) = p s + p t p 1 , and  d e g ( x i , 0 , d k ) = p t + t s t 1 , where  0 x i Z p 0 y j Z t  and  0 d k Z s . Hence, the minimum degree of the graph  W Γ ( Z p × Z t × Z s )  is
δ ( W Γ ( Z p × Z t × Z s ) ) = m i n { p s + t s s 1 , p s + p t p 1 , p t + t s t 1 } .
Example 2. 
The minimum degree of the graph  W Γ ( Z 3 × Z 3 × Z 3 )  is given by  δ ( W Γ ( Z 3 × Z 3 × Z 3 ) ) = m i n { 3 × 3 + 3 × 3 3 1 , 3 × 3 + 3 × 3 3 1 , 3 × 3 + 3 × 3 3 1 } = 14 . The result is also verified by Example 3.
Theorem 4. 
The degree sequence and irregularity index for  W Γ ( Z p × Z t × Z s ) , where p, t, and s are distinct prime numbers greater than 2, is given by
D S ( W Γ ( Z p × Z t × Z s ) ) = { p t + t s + p s s p t 1 ( p 1 ) times , p t + t s + p s s p t 1 ( t 1 ) times , p t + t s + p s s p t 1 ( s 1 ) times , p s + t s s 1 ( p 1 ) ( t 1 ) times , p s + p t p 1 ( t 1 ) ( s 1 ) times , p t + t s t 1 ( p 1 ) ( s 1 ) times } ,
and
t ( W Γ ( Z p × Z t × Z s ) ) = 4 .
Proof. 
From Theorem 1, we see that  d e g ( x i , 0 , 0 ) = p t + t s + p s p t s 1 ,  and the vertices of type  ( x i , 0 , 0 )  are  p 1 , where  0 x i Z p . Also,  d e g ( 0 , y j , 0 ) = p t + t s + p s p t s 1 , and the number of these types of vertices are  t 1 , for  0 y j Z t . Moreover, the vertices of the form  ( 0 , 0 , d k )  are  s 1  having degree  p t + t s + p s p t s 1 , where  0 d k Z s .
Again, by Theorem 1, for  0 x i Z p  and  0 y j Z t d e g ( x i , y j , 0 ) = p s + t s s 1 , and the number of these type of vertices is  ( p 1 ) ( t 1 ) . Similarly, for  0 y j Z t  and  0 d k Z s d e g ( 0 , y j , d k ) = p s + p t p 1 , and the number of vertices of the form  ( 0 , y j , d k )  is  ( t 1 ) ( s 1 ) . Moreover, the number of vertices of the type  ( x i , 0 , d k )  is  ( p 1 ) ( s 1 )  and  d e g ( x i , 0 , d k ) = p t + t s t 1 , where  0 x i Z p  and  0 d k Z s ; hence, we obtain the desired result. Also, it is clear that the irregularity index of the graph  W Γ ( Z p × Z t × Z s )  is 4. □
Remark 1. 
t ( W Γ ( Z p × Z t × Z s ) ) = 2  when the prime numbers  p , t , and s are equal.
The following example shows the degree sequence, maximum and minimum degree, and irregularity index of  W Γ ( Z 3 × Z 3 × Z 3 ) , which is helpful for the verification of our results.
Example 3. 
W Γ ( Z 3 × Z 3 × Z 3 )  is shown in Figure 1, and some properties of  W Γ ( Z 3 × Z 3 × Z 3 )  are as follows:
(1) 
Δ ( Γ ( Z 3 × Z 3 × Z 3 ) ) = 17 ,
(2) 
δ ( Γ ( Z 3 × Z 3 × Z 3 ) ) = 14 ,
(3) 
D S ( Γ ( Z 3 × Z 3 × Z 3 ) ) = { 17 , 17 , 17 , 17 , 17 , 17 , 14 , 14 , 14 , 14 , 14 , 14 , 14 , 14 , 14 , 14 , 14 , 14 } ,
(4) 
t ( Γ ( Z 3 × Z 3 × Z 3 ) ) = 2 .

4. Some Topological Indices of  W Γ ( Z p × Z t × Z s )

In the subsequent section, we delve into distinct attributes of the graph  W Γ ( Z p × Z t × Z s ) , known as topological indices. The numerical value  T o p ( G ) , referred to as the topological index of a graph G, remains constant for all graphs H that exhibit isomorphism with G. In essence, the topological index serves as an unchanging attribute of a graph, maintaining its consistency across isomorphic instances. We discuss some of the specific topological indices associated with the graph  W Γ ( Z p × Z t × Z s ) .
Theorem 5. 
The first Zagreb index of the graph  W Γ ( Z p × Z t × Z s )  is given by
M 1 ( W Γ ( Z p × Z t × Z s ) ) = i , j , k { p , t , s } i j k ( i 1 ) ( k 1 ) ( i j + j k j 1 ) 2 + ( p t + t s + p s p t s 1 ) 2 ( p + t + s 3 ) .
Proof. 
From Theorem 4 and Definition 1, we have
M 1 ( W Γ ( Z p × Z t × Z s ) ) = u V ( G ) d 2 ( u ) = ( p 1 ) ( p t + t s + p s p t s 1 ) 2 + ( t 1 ) ( p t + t s + p s p t s 1 ) 2 + ( s 1 ) ( p t + t s + p s p t s 1 ) 2 + ( p 1 ) ( t 1 ) ( p s + t s s 1 ) 2 + ( t 1 ) ( s 1 ) ( p s + p t p 1 ) 2 + ( s 1 ) ( p 1 ) ( p t + t s t 1 ) 2 = i , j , k { p , t , s } i j k ( i 1 ) ( k 1 ) ( i j + j k j 1 ) 2 + ( p t + t s + s p p t s 1 ) 2 ( p + t + s 3 ) .
Theorem 6. 
The second Zagreb index of the graph  W Γ ( Z p × Z t × Z s )  is given by
M 2 ( W Γ ( Z p × Z t × Z s ) ) = A 1 3 2 A 1 2 + A 0 A 1 ( A 2 + A 4 + A 5 ) + A 2 A 3 + A 4 A 5 ,
where
A 0 = p + t + s 3 , A 1 = p t + t s + s p p t s 1 ,
A 2 = ( p s + p t p 1 ) ( t 1 ) ( s 1 ) ,
A 3 = 2 p 2 t s p 2 t t 2 s s 2 t s p 2 + p t s 2 + p t 2 s 6 p t s 3 p t 4 t s p s 2 p 2 ,
A 4 = ( p s + t s s 1 ) ( p 1 ) ( t 1 ) , A 5 = ( p t + t s t 1 ) ( p 1 ) ( s 1 ) .
Proof. 
By the use of Definitions 1 and 5, we have
M 2 ( W Γ ( Z p × Z t × Z s ) ) = ( i ) E ( G ) d ( x i , 0 , 0 ) d ( 0 , y j , 0 ) + ( i i ) E ( G ) d ( x i , 0 , 0 ) d ( 0 , 0 , d k ) + ( i i i ) E ( G ) d ( x i , 0 , 0 ) d ( 0 , y j , d k ) + ( v ) E ( G ) d ( x i , 0 , 0 ) d ( x i , y j , 0 )
+ ( v i ) E ( G ) d ( x i , 0 , 0 ) d ( x i , 0 , d k ) + ( i v ) E ( G ) , x i x i d ( x i , 0 , 0 ) d ( x i , 0 , 0 ) + ( v i i ) E ( G ) d ( 0 , y j , 0 ) d ( 0 , 0 , d k ) + ( x ) E ( G ) d ( 0 , y j , 0 ) d ( x i , y j , 0 ) + ( i x ) E ( G ) d ( 0 , y j , 0 ) d ( 0 , y j , d k ) + ( x i i i ) E ( G ) d ( 0 , y j , 0 ) d ( x i , 0 , d k ) + ( x i ) E ( G ) , y j y j d ( 0 , y j , 0 ) d ( 0 , y j , 0 ) + ( x i i i ) E ( G ) d ( 0 , 0 , d k ) d ( x i , 0 , d k ) + ( x i v ) E ( G ) d ( 0 , 0 , d k ) d ( 0 , y j , d k ) + ( x i i ) E ( G ) d ( 0 , 0 , d k ) d ( x i , y j , 0 ) + ( x v ) E ( G ) , d k d k d ( 0 , 0 , d k ) d ( 0 , 0 , d k ) + ( x v i ) E ( G ) d ( x i , 0 , d k ) d ( x i , y j , 0 ) + ( x v i i ) E ( G ) d ( x i , 0 , d k ) d ( 0 , y j , d k ) + ( x v i i i ) E ( G ) d ( x i , y j , 0 ) d ( 0 , y j , d k ) . B y a p p l y i n g T h e o r e m , w e o b t a i n M 2 ( W Γ ( Z p × Z t × Z s ) ) = ( p t + t s + s p p t s 1 ) ( p 1 ) ( p t + t s + s p p t s 1 ) ( t 1 ) + ( p t + t s + s p p t s 1 ) ( p 1 ) ( p t + t s + s p p t s 1 ) ( s 1 ) + ( p t + t s + s p p t s 1 ) ( p 1 ) ( p s + p t p 1 ) ( t 1 ) ( s 1 ) + ( p t + t s + s p p t s 1 ) ( p 1 ) ( p s + t s s 1 ) ( p 1 ) ( t 1 ) + ( p t + t s + s p p t s 1 ) ( p 1 ) ( p t + t s t 1 ) ( p 1 ) ( s 1 ) + ( p t + t s + s p p t s 1 ) 1 ( p t + t s + s p p t s 1 ) ( p 2 ) + ( p t + t s + s p p t s 1 ) ( t 1 ) ( p t + t s + s p p t s 1 ) ( s 1 ) + ( p t + t s + s p p t s 1 ) ( t 1 ) ( p s + t s s 1 ) ( p 1 ) ( t 1 )
+ ( p t + t s + s p p t s 1 ) ( t 1 ) ( p s + p t p 1 ) ( t 1 ) ( s 1 ) + ( p t + t s + s p p t s 1 ) ( t 1 ) ( p t + t s t 1 ) ( p 1 ) ( s 1 ) + ( p t + t s + s p p t s 1 ) 1 ( p t + t s + s p p t s 1 ) ( t 2 ) + ( p t + t s + s p p t s 1 ) ( s 1 ) ( p t + t s t 1 ) ( p 1 ) ( s 1 ) + ( p t + t s + s p p t s 1 ) ( s 1 ) ( p s + p t p 1 ) ( t 1 ) ( s 1 ) + ( p t + t s + s p p t s 1 ) ( s 1 ) ( p s + t s s 1 ) ( p 1 ) ( t 1 ) + ( p t + t s + s p p t s 1 ) 1 ( p t + t s + s p p t s 1 ) ( s 2 ) + ( p t + t s t 1 ) ( p 1 ) ( s 1 ) ( p s + t s s 1 ) ( p 1 ) ( t 1 ) + ( p t + t s t 1 ) ( p 1 ) ( s 1 ) ( p s + p t p 1 ) ( t 1 ) ( s 1 ) + ( p s + t s s 1 ) ( p 1 ) ( t 1 ) ( p s + p t p 1 ) ( t 1 ) ( s 1 ) .
On solving and taking
A 0 = p + t + s 3 , A 1 = p t + t s + s p p t s 1 ,
A 2 = ( p s + p t p 1 ) ( t 1 ) ( s 1 ) ,
A 3 = 2 p 2 t s p 2 t t 2 s s 2 t s p 2 + p t s 2 + p t 2 s 6 p t s 3 p t 4 t s p s 2 p 2 ,
A 4 = ( p s + t s s 1 ) ( p 1 ) ( t 1 ) , A 5 = ( p t + t s t 1 ) ( p 1 ) ( s 1 ) ,
we obtain
M 2 ( W Γ ( Z p × Z t × Z s ) ) = A 1 3 2 A 1 2 + A 0 A 1 ( A 2 + A 4 + A 5 ) + A 2 A 3 + A 4 A 5 .
Theorem 7. 
The first Zagreb coindex of the graph  W Γ ( Z p × Z t × Z s )  is given as
M 1 ¯ ( W Γ ( Z p × Z t × Z s ) ) = 2 ( P + Q + R ) ,
where  P = ( p 1 ) ( t 1 ) ( p s + t s s 1 ) , Q = ( t 1 ) ( s 1 ) ( p s + p t p 1 ) , and  R = ( s 1 ) ( p 1 ) ( p t + t s t 1 ) .
Proof. 
From Definition 5, we have,  ( x i , y j , 0 ) ( x i , y j , 0 ) ( 0 , y j , d k ) ( 0 , y j , d k ) , and  ( x i , 0 , d k ) ( x i , 0 , d k ) . Therefore, using Definition 2, we obtain
M ¯ 1 ( W Γ ( Z p × Z t × Z s ) ) = ( x i , y j , 0 ) ( x i , y j , 0 ) , x i x i o r y j y j [ d ( x i , y j , 0 ) + d ( x i , y j , 0 ) ] + ( 0 , y j , d k ) ( 0 , y j , d k ) , y j y j o r d k d k [ d ( 0 , y j , d k ) + d ( 0 , y j , d k ) ] + ( x i , 0 , d k ) ( x i , 0 , d k ) , x i x i o r d k d k [ d ( x i , 0 , d k ) + d ( x i , 0 , d k ) ] .
Using Theorem 4, we have
M ¯ 1 ( W Γ ( Z p × Z t × Z s ) ) = ( p s + t s s 1 ) ( p 1 ) ( t 1 ) + ( p s + t s s 1 ) ( p 1 ) ( t 1 ) + ( p s + p t p 1 ) ( t 1 ) ( s 1 ) + ( p s + p t p 1 ) ( t 1 ) ( s 1 ) + ( p t + t s t 1 ) ( p 1 ) ( s 1 ) + ( p t + t s t 1 ) ( p 1 ) ( s 1 ) .
On taking  P = ( p 1 ) ( t 1 ) ( p s + t s s 1 ) , Q = ( t 1 ) ( s 1 ) ( p s + p t p 1 ) , R = ( s 1 ) ( p 1 ) ( p t + t s t 1 ) , we obtain
M ¯ 1 ( W Γ ( Z p × Z t × Z s ) ) = 2 ( P + Q + R ) .
This completes the proof. □
Theorem 8. 
The second Zagreb coindex of the graph  W Γ ( Z p × Z t × Z s )  is given by
M 2 ¯ ( W Γ ( Z p × Z t × Z s ) ) = ( A 2 + B 2 + C 2 ) ,
where  A = ( p 1 ) ( t 1 ) ( p s + t s s 1 ) , B = ( t 1 ) ( s 1 ) ( p s + p t p 1 ) , and  C = ( s 1 ) ( p 1 ) ( p t + t s t 1 ) .
Proof. 
From Definition 5, we have,  ( x i , y j , 0 ) ( x i , y j , 0 ) ( 0 , y j , d k ) ( 0 , y j , d k ) , and  ( x i , 0 , d k ) ( x i , 0 , d k ) . Therefore, using Definition 2, we have
M ¯ 1 ( W Γ ( Z p × Z t × Z s ) ) = ( x i , y j , 0 ) ( x i , y j , 0 ) , x i x i o r y j y j , [ d ( x i , y j , 0 ) d ( x i , y j , 0 ) ] + ( 0 , y j , d k ) ( 0 , y j , d k ) , y j y j o r d k d k [ d ( 0 , y j , d k ) d ( 0 , y j , d k ) ] + ( x i , 0 , d k ) ( x i , 0 , d k ) , x i x i o r d k d k , [ d ( x i , 0 , d k ) d ( x i , 0 , d k ) ] .
Using Theorem 4, we have
M ¯ 1 ( W Γ ( Z p × Z t × Z s ) ) = ( p s + t s s 1 ) ( p 1 ) ( t 1 ) ( p s + t s s 1 ) ( p 1 ) ( t 1 ) + ( p s + p t p 1 ) ( t 1 ) ( s 1 ) ( p s + p t p 1 ) ( t 1 ) ( s 1 ) + ( p t + t s t 1 ) ( p 1 ) ( s 1 ) ( p t + t s t 1 ) ( p 1 ) ( s 1 ) .
On taking  A = ( p 1 ) ( t 1 ) ( p s + t s s 1 ) , B = ( t 1 ) ( s 1 ) ( p s + p t p 1 )  and  C = ( s 1 ) ( p 1 ) ( p t + t s t 1 ) , we obtain
M 2 ¯ ( W Γ ( Z p × Z t × Z s ) ) = ( A 2 + B 2 + C 2 ) .
Hence, the proof is complete. □
Theorem 9. 
The first multiplicative Zagreb index of the graph  W Γ ( Z p × Z t × Z s )  is given by
1 ( W Γ ( Z p × Z t × Z s ) ) = ( p 1 ) 3 ( t 1 ) 3 ( s 1 ) 3 ( p t + t s + s p p t s 1 ) 6 ( p s + t s s 1 ) 2 ( p s + p t p 1 ) 2 ( p t + t s t 1 ) 2 .
Proof. 
From Theorem 4 and Definition 3, we have
1 ( W Γ ( Z p × Z t × Z s ) ) = v V ( G ) d ( v ) 2 = ( p t + t s + s p p t s 1 ) 2 ( p 1 ) × ( p t + t s + s p p t s 1 ) 2 ( t 1 ) × ( p t + t s + s p p t s 1 ) 2 ( s 1 ) × ( p s + t s s 1 ) 2 ( p 1 ) ( t 1 ) × ( p s + p t p 1 ) 2 ( t 1 ) ( s 1 ) × ( p t + t s t 1 ) 2 ( s 1 ) ( p 1 ) = ( p 1 ) 3 ( t 1 ) 3 ( s 1 ) 3 ( p t + t s + s p p t s 1 ) 6 ( p s + t s s 1 ) 2 ( p s + p t p 1 ) 2 ( p t + t s t 1 ) 2 .
Theorem 10. 
The second multiplicative Zagreb index of the graph  W Γ ( Z p × Z t × Z s )  is given as
2 ( W Γ ( Z p × Z t × Z s ) ) = ( p 1 ) 15 ( t 1 ) 15 ( s 1 ) 15 ( p 2 ) ( t 2 ) ( s 2 ) ( p t + t s + s p p t s 1 ) 15 ( p s + p t p 1 ) 5 ( p s + t s s 1 ) 5 ( p t + t s t 1 ) 5 .
Proof. 
From Definition 3, we have
2 ( W Γ ( Z p × Z t × Z s ) ) = ( i ) E ( G ) d ( x i , 0 , 0 ) d ( 0 , y j , 0 ) × ( i i ) E ( G ) d ( x i , 0 , 0 ) d ( 0 , 0 , d k ) × ( i i i ) E ( G ) d ( x i , 0 , 0 ) d ( 0 , y j , d k ) × ( v ) E ( G ) d ( x i , 0 , 0 ) d ( x i , y j , 0 ) × ( v i ) E ( G ) d ( x i , 0 , 0 ) d ( x i , 0 , d k ) × ( i v ) E ( G ) , x i x i d ( x i , 0 , 0 ) d ( x i , 0 , 0 ) × ( v i i ) E ( G ) d ( 0 , y j , 0 ) d ( 0 , 0 , d k ) × ( x ) E ( G ) d ( 0 , y j , 0 ) d ( x i , y j , 0 ) × ( i x ) E ( G ) d ( 0 , y j , 0 ) d ( 0 , y j , d k ) × ( v i i i ) E ( G ) d ( 0 , y j , 0 ) d ( x i , 0 , d k ) × ( x i ) E ( G ) , y j y j d ( 0 , y j , 0 ) d ( 0 , y j , 0 )
× ( x i i i ) E ( G ) d ( 0 , 0 , d k ) d ( x i , 0 , d k ) × ( x i v ) E ( G ) d ( 0 , 0 , d k ) d ( 0 , y j , d k ) × ( x i i ) E ( G ) d ( 0 , 0 , d k ) d ( x i , y j , 0 ) × ( x v ) E ( G ) , d k d k d ( 0 , 0 , d k ) d ( 0 , 0 , d k ) × ( x v i ) E ( G ) d ( x i , 0 , d k ) d ( x i , y j , 0 ) × ( x v i i ) E ( G ) d ( x i , 0 , d k ) d ( 0 , y j , d k ) × ( x v i i i ) E ( G ) d ( x i , y j , 0 ) d ( 0 , y j , d k ) .
By applying Theorem 1, we obtain
2 ( W Γ ( Z p × Z t × Z s ) ) = ( p t + t s + p s p t s 1 ) ( p 1 ) ( p t + t s + p s p t s 1 ) ( t 1 ) × ( p t + t s + p s p t s 1 ) ( p 1 ) ( p t + t s + p s p t s 1 ) ( s 1 ) × ( p t + t s + p s p t s 1 ) ( p 1 ) ( p s + p t p 1 ) ( t 1 ) ( s 1 ) × ( p t + t s + p s p t s 1 ) ( p 1 ) ( p s + t s s 1 ) ( p 1 ) ( t 1 ) × ( p t + t s + p s p t s 1 ) ( p 1 ) ( p t + t s t 1 ) ( p 1 ) ( s 1 ) × ( p t + t s + p s p t s 1 ) 1 ( p t + t s + p s p t s 1 ) ( p 2 ) × ( p t + t s + p s p t s 1 ) ( t 1 ) ( p t + t s + p s p t s 1 ) ( s 1 ) × ( p t + t s + p s p t s 1 ) ( t 1 ) ( p s + t s s 1 ) ( p 1 ) ( t 1 ) × ( p t + t s + p s p t s 1 ) ( t 1 ) ( p s + p t p 1 ) ( t 1 ) ( s 1 ) × ( p t + t s + p s p t s 1 ) ( t 1 ) ( p t + t s t 1 ) ( p 1 ) ( s 1 ) × ( p t + t s + p s p t s 1 ) 1 ( p t + t s + p s p t s 1 ) ( t 2 ) × ( p t + t s + p s p t s 1 ) ( s 1 ) ( p t + t s t 1 ) ( p 1 ) ( s 1 ) × ( p t + t s + p s p t s 1 ) ( s 1 ) ( p s + p t p 1 ) ( t 1 ) ( s 1 ) × ( p t + t s + p s p t s 1 ) ( s 1 )
( p s + t s s 1 ) ( p 1 ) ( t 1 ) × ( p t + t s + p s p t s 1 ) 1 ( p t + t s + p s p t s 1 ) ( s 2 ) × ( p t + t s t 1 ) ( p 1 ) ( s 1 ) ( p s + t s s 1 ) ( p 1 ) ( t 1 ) × ( p t + t s t 1 ) ( p 1 ) ( s 1 ) ( p s + p t p 1 ) ( t 1 ) ( s 1 ) × ( p s + t s s 1 ) ( p 1 ) ( t 1 ) ( p s + p t p 1 ) ( t 1 ) ( s 1 ) .
On solving, we obtain
2 ( W Γ ( Z p × Z t × Z s ) ) = ( p 1 ) 15 ( t 1 ) 15 ( s 1 ) 15 ( p 2 ) ( t 2 ) ( s 2 ) ( p t + t s + p s p t s 1 ) 15 ( p s + p t p 1 ) 5 ( p s + t s s 1 ) 5 ( p t + t s t 1 ) 5 .
Theorem 11. 
The first multiplicative Zagreb coindices index of the graph  W Γ ( Z p × Z t × Z s )  is given by
¯ 1 ( W Γ ( Z p × Z t × Z s ) ) = 2 ( P × Q × R ) ,
where  P = ( p s + t s s 1 ) ( p 1 ) ( t 1 ) Q = ( p s + p t p 1 ) ( t 1 ) ( s 1 ) ,  and  R = ( p t + t s t 1 ) ( p 1 ) ( s 1 ) .
Proof. 
From Definition 5, clearly the nonadjacent vertices are  ( x i , y j , 0 ) ( x i , y j , 0 ) ( 0 , y j , d k ) ( 0 , y j , d k ) , and  ( x i , 0 , d k ) ( x i , 0 , d k ) . Therefore, using Definition 4, we have
¯ 1 ( W Γ ( Z p × Z t × Z s ) ) = ( x i , y j , 0 ) ( x i , y j , 0 ) , x i x i o r y j y j [ d ( x i , y j , 0 ) + d ( x i , y j , 0 ) ] × ( 0 , y j , d k ) ( 0 , y j , d k ) , y j y j o r d k d k [ d ( 0 , y j , d k ) + d ( 0 , y j , d k ) ] × ( x i , 0 , d k ) ( x i , 0 , d k ) , x i x i o r d k d k [ d ( x i , 0 , d k ) + d ( x i , 0 , d k ) ] .
Now using Theorem 4, we obtain
¯ 1 ( W Γ ( Z p × Z t × Z s ) ) = [ ( p s + t s s 1 ) ( p 1 ) ( t 1 ) + ( p s + t s s 1 ) ( p 1 ) ( t 1 ) ] × [ ( p s + p t p 1 ) ( t 1 ) ( s 1 ) + ( p s + p t p 1 ) ( t 1 ) ( s 1 ) ] × [ ( p t + t s t 1 ) ( p 1 ) ( s 1 ) + ( p t + t s t 1 ) ( p 1 ) ( s 1 ) ] .
On taking  P = ( p s + t s s 1 ) ( p 1 ) ( t 1 ) , Q = ( p s + p t p 1 ) ( t 1 ) ( s 1 ) , and  R = ( p t + t s t 1 ) ( p 1 ) ( s 1 ) , we obtain
¯ 1 ( W Γ ( Z p × Z t × Z s ) ) = 2 ( P × Q × R ) .
Theorem 12. 
The second multiplicative Zagreb coindices index of the graph  W Γ ( Z p × Z t × Z s )  is given by
¯ 2 ( W Γ ( Z p × Z t × Z s ) ) = ( p 1 ) 4 ( t 1 ) 4 ( s 1 ) 4 ( p s + t s s 1 ) 2 ( p s + p t p 1 ) 2 ( p t + t s t 1 ) 2 .
Proof. 
From Definition 5, it is clear that the nonadjacent vertices of  W Γ ( Z p × Z t × Z s )  are  ( x i , y j , 0 ) ( x i , y j , 0 ) ( 0 , y j , d k ) ( 0 , y j , d k ) , and  ( x i , 0 , d k ) ( x i , 0 , d k ) . Therefore, using Definition 4, we have
¯ 2 ( W Γ ( Z p × Z t × Z s ) ) = ( x i , y j , 0 ) ( x i , y j , 0 ) , x i x i o r y j y j [ d ( x i , y j , 0 ) d ( x i , y j , 0 ) ] × ( 0 , y j , d k ) ( 0 , y j , d k ) , y j y j , d k d k [ d ( 0 , y j , d k ) d ( 0 , y j , d k ) ] × ( x i , 0 , d k ) ( x i , 0 , d k ) , x i x i o r d k d k [ d ( x i , 0 , d k ) d ( x i , 0 , d k ) ] .
Now using Theorem 4, we obtain
¯ 2 ( W Γ ( Z p × Z t × Z s ) ) = [ ( p s + t s s 1 ) ( p 1 ) ( t 1 ) × ( p s + t s s 1 ) ( p 1 ) ( t 1 ) ] × [ ( p s + p t p 1 ) ( t 1 ) ( s 1 ) × ( p s + p t p 1 ) ( t 1 ) ( s 1 ) ] × [ ( p t + t s t 1 ) ( p 1 ) ( s 1 ) × ( p t + t s t 1 ) ( p 1 ) ( s 1 ) ] .
On solving, we obtain
¯ 2 ( W Γ ( Z p × Z t × Z s ) ) = ( p 1 ) 4 ( t 1 ) 4 ( s 1 ) 4 ( p s + t s s 1 ) 2 ( p s + p t p 1 ) 2 ( p t + t s t 1 ) 2 .
Hence, the proof is complete. □
Remark 2. 
From Example 3, the graph structures like  W Γ ( Z 3 × Z 3 × Z 3 ) , are similar to an important class of carbon compounds in chemistry called fullerenes. Fullerenes are the compounds in which carbon atoms are arranged in a cage-like or spherical structure. The study of fullerenes is closely related to mathematical concepts such as topology and geometry. The unique structure of fullerenes with carbon atoms forming polygons on the surface of a sphere is of great interest for mathematicians. We can analyze some mathematical properties such as topological indices of these complicated compounds by these formulae, and our results are more general than the previous studies.

5. Conclusions

The study has delved into the examination of various graph indices and coindices within this unique mathematical structure, including the first and second Zagreb indices and coindices, as well as the first and second multiplicative Zagreb indices and coindices. This research is significant for several reasons: it provides valuable insights into the structure and properties of the weakly zero-divisor graph, extending our understanding of this mathematical concept in the context of ring theory. The study reinforces the connections between ring theory and graph theory, highlighting the usefulness of graph theory in representing and analyzing algebraic structures. By examining Zagreb indices and coindices, this research offers a quantitative approach to characterizing the topology of  W Γ ( Z p × Z t × Z s ) . Such numerical descriptors have practical applications in various fields, including chemistry and molecular research. The work discussed here can potentially find applications in chemical graph theory, where graph theory concepts are employed to solve molecular problems. The study of Zagreb indices can aid in predicting molecular properties, contributing to drug design, compound screening, and material science research. The approach taken in this research is versatile, as it can be applied to a wide range of ring structures, offering potential extensions and applications in diverse mathematical and scientific contexts.

Author Contributions

The material is the result of the joint efforts of N.u.R., A.S.A., S.A.M. and M.N. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by Princess Nourah bint Abdulrahman University, Riyadh, Saudi Arabia. The authors extend their appreciation to Princess Nourah bint Abdulrahman University for funding this research under Researchers Supporting Project number (PNURSP2023R231), Princess Nourah bint Abdulrahman University, Riyadh, Saudi Arabia.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

All data required for this article are included within this article.

Acknowledgments

The authors are greatly indebted to the referees for their valuable suggestions and comments, which have immensely improved the article.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Beck, I. Coloring of commutative rings. J. Algebra 1988, 116, 208–226. [Google Scholar] [CrossRef]
  2. Anderson, D.F.; Livingston, P.S. The zero-divisor graph of a commutative ring. J. Algebra 1999, 217, 434–447. [Google Scholar] [CrossRef]
  3. Akgüneş, N. Analyzing special parameters over zero-divisor graphs. AIP Conf. Proc. 2012, 1479, 390–392. [Google Scholar]
  4. Anderson, D.D.; Naseer, M. Beck’s coloring of a commutative ring. J. Algebra 1993, 159, 500–514. [Google Scholar] [CrossRef]
  5. Aykaç, S.; Akgüneş, N. Analysis of graph parameters associated with zero-divisor graphs of commutative rings. New Trends Math. Sci. 2018, 6, 144–149. [Google Scholar] [CrossRef]
  6. Gross, J.L.; Yellen, J. Handbook of Graph Theory; CRC Press: Boca Raton, FL, USA, 2004. [Google Scholar]
  7. Kuzmina, A.S.; Maltsev, Y.N. On finite rings in which zero-divisor graphs satisfy the Dirac’s condition. Lobachevskii J. Math 2015, 36, 375–383. [Google Scholar] [CrossRef]
  8. Kuzmina, A.S.; Maltsev, Y.N. Finite rings with some restrictions on zero-divisor graphs. Russian Math. 2014, 58, 41–50. [Google Scholar] [CrossRef]
  9. Kuzmina, A.S. Finite rings with Eulerian zero-divisor graphs. J. Algebra Appli. 2012, 11, 1250055. [Google Scholar] [CrossRef]
  10. Mukwembi, S. A note on diameter and the degree sequence of a graph. Appl. Math. Lett. 2012, 25, 175–178. [Google Scholar] [CrossRef]
  11. Das, K.C.; Akgüneş, N.; Togan, M.; Yurttas, A.; Cangul, I.N.; Çevik, A.S. On the first Zagreb index and multiplicative Zagreb coindices of graphs. Analele Stiint. Univ. Ovidius Constanta Ser. Mat. 2016, 24, 153–176. [Google Scholar] [CrossRef]
  12. Sharma, P.; Sharma, A.; Vats, R.K. Analysis of adjacency matrix and neighborhood associated with zero divisor graph of finite commutative rings. Int. J. Comput. Appl. 2011, 14, 38–42. [Google Scholar] [CrossRef]
  13. Akgüneş, N.; Togan, M. Some graph theoretical properties over zero-divisor graphs of special finite commutative rings. Adv. Stud. Contemp. Math. 2012, 22, 309–315. [Google Scholar]
  14. Nikmehr, M.J.; Azadi, A.; Nikandish, R. The weakly zero-divisor graph of a commutative ring. Rev. Union Math. Argent. 2021, 62, 105–116. [Google Scholar] [CrossRef]
  15. Gutman, I.; Milovanović, E.; Milovanović, I. Beyond the Zagreb indices. AKCE Int. J. Graphs Comb. 2018, 17, 74–85. [Google Scholar] [CrossRef]
  16. Jude, T.P.; Panchadcharam, E.; Masilamani, K. Topological Indices of Dendrimers used in Drug Delivery. J. Sci. Res. 2020, 12, 645–655. [Google Scholar] [CrossRef]
  17. Pirzada, S. An Introduction to Graph Theory; Orient Blakswan: Hyderabad, India, 2012. [Google Scholar]
  18. Gutman, I.; Das, K.C. The first Zagreb index 30 years after. MATCH Commun. Math. Comput. Chem. 2004, 50, 83–92. [Google Scholar]
  19. Doślić, T. Vertex weighted Wiener polynomials for composite graphs. Ars. Math. Contemp. 2008, 1, 66–80. [Google Scholar] [CrossRef]
  20. Todeschini, R.; Consonni, V. New local vertex invariants and molecular descriptors based on functions of the vertex degrees. MATCH Commun. Math. Comput. Chem. 2010, 64, 359–372. [Google Scholar]
  21. Xu, K.; Das, K.C.; Tang, K. On the multiplicative Zagreb coindex of graphs. Opuscula Math. 2013, 33, 191–204. [Google Scholar] [CrossRef]
Figure 1. W Γ ( Z 3 × Z 3 × Z 3 ) .
Figure 1. W Γ ( Z 3 × Z 3 × Z 3 ) .
Axioms 12 00987 g001
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

Rehman, N.u.; Alali, A.S.; Mir, S.A.; Nazim, M. Analysis of the Zagreb Indices over the Weakly Zero-Divisor Graph of the Ring Zp×Zt×Zs. Axioms 2023, 12, 987. https://doi.org/10.3390/axioms12100987

AMA Style

Rehman Nu, Alali AS, Mir SA, Nazim M. Analysis of the Zagreb Indices over the Weakly Zero-Divisor Graph of the Ring Zp×Zt×Zs. Axioms. 2023; 12(10):987. https://doi.org/10.3390/axioms12100987

Chicago/Turabian Style

Rehman, Nadeem ur, Amal S. Alali, Shabir Ahmad Mir, and Mohd Nazim. 2023. "Analysis of the Zagreb Indices over the Weakly Zero-Divisor Graph of the Ring Zp×Zt×Zs" Axioms 12, no. 10: 987. https://doi.org/10.3390/axioms12100987

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