A generalization of zero-divisor graphs

11/14/2019
by   Peyman Nasehpour, Ph.D., et al.
1

In this paper, we introduce a family of graphs which is a generalization of zero-divisor graphs and compute an upper-bound for the diameter of such graphs. We also investigate their cycles and cores.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/16/2019

Cops and Robbers on graphs of bounded diameter

The game of Cops and Robbers is a well known game played on graphs. In t...
research
01/10/2020

An Improvement to Chvátal and Thomassen's Upper Bound for Oriented Diameter

An orientation of an undirected graph G is an assignment of exactly one ...
research
05/05/2021

The ratio of the numbers of odd and even cycles in outerplanar graphs

In this paper, we investigate the ratio of the numbers of odd and even c...
research
08/15/2018

Forbidden cycles in metrically homogeneous graphs

Aranda, Bradley-Williams, Hubička, Karamanlis, Kompatscher, Konečný and ...
research
01/19/2021

Colouring Graphs of Bounded Diameter in the Absence of Small Cycles

For k≥ 1, a k-colouring c of G is a mapping from V(G) to {1,2,…,k} such ...
research
07/18/2023

Maximal diameter of integral circulant graphs

Integral circulant graphs are proposed as models for quantum spin networ...
research
02/18/2020

An Upper Bound for Sorting R_n with LRE

A permutation π over alphabet Σ = 1,2,3,...,n, is a sequence where every...

Please sign up or login with your details

Forgot password? Click here to reset