Displaying similar documents to “On the intersection graphs of ideals of direct product of rings”

An ideal-based zero-divisor graph of direct products of commutative rings

S. Ebrahimi Atani, M. Shajari Kohan, Z. Ebrahimi Sarvandi (2014)

Discussiones Mathematicae - General Algebra and Applications

Similarity:

In this paper, specifically, we look at the preservation of the diameter and girth of the zero-divisor graph with respect to an ideal of a commutative ring when extending to a finite direct product of commutative rings.

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.

The edge C₄ graph of some graph classes

Manju K. Menon, A. Vijayakumar (2010)

Discussiones Mathematicae Graph Theory

Similarity:

The edge C₄ graph of a graph G, E₄(G) is a graph whose vertices are the edges of G and two vertices in E₄(G) are adjacent if the corresponding edges in G are either incident or are opposite edges of some C₄. In this paper, we show that there exist infinitely many pairs of non isomorphic graphs whose edge C₄ graphs are isomorphic. We study the relationship between the diameter, radius and domination number of G and those of E₄(G). It is shown that for any graph G without isolated vertices,...

Regularity and Planarity of Token Graphs

Walter Carballosa, Ruy Fabila-Monroy, Jesús Leaños, Luis Manuel Rivera (2017)

Discussiones Mathematicae Graph Theory

Similarity:

Let G = (V, E) be a graph of order n and let 1 ≤ k < n be an integer. The k-token graph of G is the graph whose vertices are all the k-subsets of V, two of which are adjacent whenever their symmetric difference is a pair of adjacent vertices in G. In this paper we characterize precisely, for each value of k, which graphs have a regular k-token graph and which connected graphs have a planar k-token graph.

A classification for maximal nonhamiltonian Burkard-Hammer graphs

Ngo Dac Tan, Chawalit Iamjaroen (2008)

Discussiones Mathematicae Graph Theory

Similarity:

A graph G = (V,E) is called a split graph if there exists a partition V = I∪K such that the subgraphs G[I] and G[K] of G induced by I and K are empty and complete graphs, respectively. In 1980, Burkard and Hammer gave a necessary condition for a split graph G with |I| < |K| to be hamiltonian. We will call a split graph G with |I| < |K| satisfying this condition a Burkard-Hammer graph. Further, a split graph G is called a maximal nonhamiltonian split graph if G is nonhamiltonian...