On Seidel Laplacian spectrum of the zero-divisor graph over ℤn

Consider a commutative ring denoted as [Formula: see text], and let [Formula: see text] represent its set of zero-divisors. The zero-divisor graph of [Formula: see text], symbolized as [Formula: see text], is a type of undirected graph characterized by its vertex set, [Formula: see text]. Within this graph, two distinct vertices, labeled as [Formula: see text] and [Formula: see text], are linked by an edge if and only if their product, [Formula: see text]. This article delves into the exploration of Seidel Laplacian eigenvalues in the context of the graphs [Formula: see text], with a specific focus on instances where [Formula: see text] and [Formula: see text]. Here, [Formula: see text], and [Formula: see text], represent distinct prime numbers, with [Formula: see text] being less than [Formula: see text], while [Formula: see text] is a positive integer. As consequences of our main theorems, several known results can be either generalized or deduced.

Authors

Institutions

Publication Details

Journal
Discrete Mathematics Algorithms and Applications
Published
2025-12-20
DOI
https://doi.org/10.1142/s1793830925501885
Primary Topic
Rings, Modules, and Algebras
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

On Seidel Laplacian spectrum of the zero-divisor graph over ℤn

Shakir Ali, Muzibur Rahman Mozumder, Muhammad Ashraf, Mohd Zamzuri Ab Rashid
Discrete Mathematics Algorithms and Applications
Rings, Modules, and Algebras
article

On Seidel Laplacian spectrum of the zero-divisor graph over ℤn

Shakir Ali, Muzibur Rahman Mozumder, Muhammad Ashraf, Mohd Zamzuri Ab Rashid
article en

Abstract

Consider a commutative ring denoted as [Formula: see text], and let [Formula: see text] represent its set of zero-divisors. The zero-divisor graph of [Formula: see text], symbolized as [Formula: see text], is a type of undirected graph characterized by its vertex set, [Formula: see text]. Within this graph, two distinct vertices, labeled as [Formula: see text] and [Formula: see text], are linked by an edge if and only if their product, [Formula: see text]. This article delves into the exploration of Seidel Laplacian eigenvalues in the context of the graphs [Formula: see text], with a specific focus on instances where [Formula: see text] and [Formula: see text]. Here, [Formula: see text], and [Formula: see text], represent distinct prime numbers, with [Formula: see text] being less than [Formula: see text], while [Formula: see text] is a positive integer. As consequences of our main theorems, several known results can be either generalized or deduced.

Discrete Mathematics Algorithms and Applications
Aligarh Muslim University (IN)
Openalex Percentile: Top 53%
Rings, Modules, and Algebras
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.