Displaying similar documents to “Some properties of the zero divisor graph of a commutative ring”

Characterizing which Powers of Hypercubes and Folded Hyper- cubes Are Divisor Graphs

Eman A. AbuHijleh, Omar A. AbuGhneim, Hasan Al-Ezeh (2015)

Discussiones Mathematicae Graph Theory

Similarity:

In this paper, we show that Qkn is a divisor graph, for n = 2, 3. For n ≥ 4, we show that Qkn is a divisor graph iff k ≥ n − 1. For folded-hypercube, we get FQn is a divisor graph when n is odd. But, if n ≥ 4 is even integer, then FQn is not a divisor graph. For n ≥ 5, we show that (FQn)k is not a divisor graph, where 2 ≤ k ≤ [n/2] − 1.

On L-ideal-based L-zero-divisor graphs

S. Ebrahimi Atani, M. Shajari Kohan (2011)

Discussiones Mathematicae - General Algebra and Applications

Similarity:

In a manner analogous to a commutative ring, the L-ideal-based L-zero-divisor graph of a commutative ring R can be defined as the undirected graph Γ(μ) for some L-ideal μ of R. The basic properties and possible structures of the graph Γ(μ) are studied.

A class of zero divisor rings in which every graph is precisely the union of a complete graph and a complete bipartite graph

Syed Khalid Nauman, Basmah H. Shafee (2015)

Open Mathematics

Similarity:

Recently, an interest is developed in estimating genus of the zero-divisor graph of a ring. In this note we investigate genera of graphs of a class of zero-divisor rings (a ring in which every element is a zero divisor). We call a ring R to be right absorbing if for a; b in R, ab is not 0, then ab D a. We first show that right absorbing rings are generalized right Klein 4-rings of characteristic two and that these are non-commutative zero-divisor local rings. The zero-divisor graph of...

Pₘ-saturated bipartite graphs with minimum size

Aneta Dudek, A. Paweł Wojda (2004)

Discussiones Mathematicae Graph Theory

Similarity:

A graph G is said to be H-saturated if G is H-free i.e., (G has no subgraph isomorphic to H) and adding any new edge to G creates a copy of H in G. In 1986 L. Kászonyi and Zs. Tuza considered the following problem: for given m and n find the minimum size sat(n;Pₘ) of Pₘ-saturated graph of order n. They gave the number sat(n;Pₘ) for n big enough. We deal with similar problem for bipartite graphs.

A Note on Total Graphs

S.F. Forouhandeh, N. Jafari Rad, B.H. Vaqari Motlagh, H.P. Patil, R. Pandiya Raj (2015)

Discussiones Mathematicae Graph Theory

Similarity:

Erratum Identification and corrections of the existing mistakes in the paper On the total graph of Mycielski graphs, central graphs and their covering numbers, Discuss. Math. Graph Theory 33 (2013) 361-371.

The Distance Magic Index of a Graph

Aloysius Godinho, Tarkeshwar Singh, S. Arumugam (2018)

Discussiones Mathematicae Graph Theory

Similarity:

Let G be a graph of order n and let S be a set of positive integers with |S| = n. Then G is said to be S-magic if there exists a bijection ϕ : V (G) → S satisfying ∑x∈N(u) ϕ(x) = k (a constant) for every u ∈ V (G). Let α(S) = max{s : s ∈ S}. Let i(G) = min α(S), where the minimum is taken over all sets S for which the graph G admits an S-magic labeling. Then i(G) − n is called the distance magic index of the graph G. In this paper we determine the distance magic index of trees and complete...

Bipartite graphs that are not circle graphs

André Bouchet (1999)

Annales de l'institut Fourier

Similarity:

The following result is proved: if a bipartite graph is not a circle graph, then its complement is not a circle graph. The proof uses Naji’s characterization of circle graphs by means of a linear system of equations with unknowns in GF ( 2 ) . At the end of this short note I briefly recall the work of François Jaeger on circle graphs.