Zero divisor index of small order graphs
Authors:
Open Access
- 1 January 2023
- conference paper
- Published by AIP Publishing in AIP Conference Proceedings
- Vol. 2852 (1)
Abstract
Let G = (V, E) be an arbitrary graph with vertex set V = V (G), edge set E = E(G) and ℝ be any nonzero commutative ring with 1 ≠ 0. Let Z(ℝ) denote the set of all zero-divisors of ℝ then, an injective function f : V→Z(ℝ)∗ is called zero-divisor labeling of G if for every edge e = uv ∈ E, f (u) f (v)= 0, where ’0’ is the additive identity of ℝ. A zero-divisor index of G is the least positive integer k such that there is a zero-divisor labeling f : V→Z(ℝ)∗ of G with |Z(ℝ)∗| = k, denoted by Θ’(G). A zero-divisor labeling f : V→Z(ℝ)∗ of G is optimal if |Z(ℝ)∗| = Θ’(G). In this paper, we determine a zero-divisor index of a graph with order n, where 1 ≤ n ≤ 15.Keywords
This publication has 9 references indexed in Scilit:
- A Dynamic Survey of Graph LabelingThe Electronic Journal of Combinatorics, 2022
- The Zero‐Divisor Graph of a Commutative Ring, II2019
- Graph LabelingThe Electronic Journal of Combinatorics, 2018
- Zero-divisor Labelings of GraphsCommunications in Algebra, 2016
- Zero-Divisor Labeling of HypercubesNational Academy Science Letters, 2014
- On zero-divisor graphs of small finite commutative ringsDiscrete Mathematics, 2007
- An Ideal-Based Zero-Divisor Graph of a Commutative RingCommunications in Algebra, 2003
- The Zero-Divisor Graph of a Commutative RingJournal of Algebra, 1999
- Zero Devisors in Commutative RingsThe American Mathematical Monthly, 1986