In this paper we consider, for a finite commutative ring R, the wellstudied zero-divisor graph Γ(R) and the compressed zero-divisor graph Γc(R) of R and a newly-defined graphical structure — the zero-divisor lattice Λ(R) of R. We give results which provide information when Γ(R) ∼= Γ(S), Γc(R) ∼= Γc(S), and Λ(R) ∼= Λ(S) for two finite commutative rings R and S. We also provide a theorem which sa...

The detour pebbling number of a graph \(G\) is the least positive integer \(f^{*}(G)\) such that these pebbles are placed on vertices \(G\), we can move pebble to target vertex by sequence moves each taking two off and placing one an adjacent using path. In this paper, compute for commutative ring zero-divisor graphs, sum product zero divisor graphs.

This paper establishes a set of theorems that describe the diameter of a zero-divisor graph for a finite direct product R1 × R2 × · · · × Rn with respect to the diameters of the zero-divisor graphs of R1, R2, · · · , Rn−1 and Rn(n > 2).

We study the problem of computing the rank of a divisor on a finite graph, a quantity that arises in the Riemann-Roch theory on the finite graph developed by Baker and Norine (Advances in Mathematics, 215(2): 766-788, 2007). Our work consists of two parts: the first part is an algorithm whose running time is polynomial for a multigraph with a fixed number of vertices. More precisely, our algori...