Skip to main navigation Skip to search Skip to main content

On degree-based entropy measure for zero-divisor graphs

Research output: Contribution to journalArticlepeer-review

4 Scopus citations

Abstract

Let R be a commutative ring with 1. A zero-divisor graph ∧(R) is an undirected graph on the vertex set R-{0} such that any two nonzero elements p,q ∈ R are adjacent whenever p · q = 0. The concept of entropy measure is fundamental and has been the subject of interest in various fields. The purpose of this paper is to calculate the entropy measure of ∧ (R) for various rings. We take into consideration the ring ℤh for h = φ ψ, φ2 φ ψ, φ2 ψ2, φ ψ χ, where φ, ψ and χ are distinct prime numbers. Moreover, we also discussed the entropy measure of the zero-divisor graph for the rings ℤ φ × ℤ ψ, ℤ φ × ℤ ψ ℤ χ, ℤ φ ψ × ℤ χ, and ℤ φ2 × ℤ ψ2. This study will help us further understand the algebraic structure of the commutative rings.

Original languageEnglish
Article number2350104
JournalDiscrete Mathematics, Algorithms and Applications
Volume16
Issue number8
DOIs
StatePublished - 1 Nov 2024
Externally publishedYes

Bibliographical note

Publisher Copyright:
© 2024 World Scientific Publishing Company.

Keywords

  • Commutative ring
  • entropy measure, structural properties commutative rings
  • zero-divisor graph

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics

Fingerprint

Dive into the research topics of 'On degree-based entropy measure for zero-divisor graphs'. Together they form a unique fingerprint.

Cite this