Laplacian spectrum of weakly zero-divisor graph

Let [Formula: see text] be a commutative ring with unity. The weakly zero-divisor graph [Formula: see text] of [Formula: see text] is the simple undirected graph whose vertices are nonzero zero-divisors of [Formula: see text] and two vertices [Formula: see text], [Formula: see text] are adjacent if and only if there exist [Formula: see text] and [Formula: see text] such that [Formula: see text]. The zero-divisor graph is a spanning subgraph of the weakly zero-divisor graph. Let [Formula: see text] denote the ring of integers modulo [Formula: see text]. It is known that the zero-divisor graph of the ring [Formula: see text], where [Formula: see text] is a prime, is Laplacian integral. In this paper, we obtain the Laplacian spectrum of the weakly zero-divisor graph [Formula: see text] of the ring [Formula: see text] and show that [Formula: see text] is Laplacian integral for arbitrary [Formula: see text]. Consequently, for each [Formula: see text], the weakly zero-divisor graph [Formula: see text] is distance Laplacian integral.

Authors

Institutions

Publication Details

Journal
Discrete Mathematics Algorithms and Applications
Published
2025-08-19
DOI
https://doi.org/10.1142/s1793830925501228
Primary Topic
Graph theory and applications
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Laplacian spectrum of weakly zero-divisor graph

Praveen Mathil, Mohd Shariq, Jitender Kumar
Discrete Mathematics Algorithms and Applications
Graph theory and applications
article

Laplacian spectrum of weakly zero-divisor graph

Praveen Mathil, Mohd Shariq, Jitender Kumar
article en

Abstract

Let [Formula: see text] be a commutative ring with unity. The weakly zero-divisor graph [Formula: see text] of [Formula: see text] is the simple undirected graph whose vertices are nonzero zero-divisors of [Formula: see text] and two vertices [Formula: see text], [Formula: see text] are adjacent if and only if there exist [Formula: see text] and [Formula: see text] such that [Formula: see text]. The zero-divisor graph is a spanning subgraph of the weakly zero-divisor graph. Let [Formula: see text] denote the ring of integers modulo [Formula: see text]. It is known that the zero-divisor graph of the ring [Formula: see text], where [Formula: see text] is a prime, is Laplacian integral. In this paper, we obtain the Laplacian spectrum of the weakly zero-divisor graph [Formula: see text] of the ring [Formula: see text] and show that [Formula: see text] is Laplacian integral for arbitrary [Formula: see text]. Consequently, for each [Formula: see text], the weakly zero-divisor graph [Formula: see text] is distance Laplacian integral.

Discrete Mathematics Algorithms and Applications
Birla Institute of Technology and Science, Pilani (IN)
Openalex Percentile: Top 73%
Graph theory and applications
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.

Laplacian spectrum of weakly zero-divisor graph — Praveen Mathil, Mohd Shariq, et al. · Discrete Mathematics Algorithms and Applications (2025) | TGRS Research Map | TGRS