Hamming graph is known to be an important class of graphs, and it is a challenge to obtain algorithms that recognize whether a given graph G is a Hamming graph. let R be a commutative  graded ring and S be the set of homogeneous elements. The Cayley graph Cay(R,S) is a graph whose vertex set […]

Let H be a subset of a commutative graded ring R. The Cayley graph Cay(R,H) is a graph whose vertex set is R and two vertices a and b are adjacent if and only if a−b ∈ H Let S be the set of homogeneous elements we study  Cay(R, S) In particular, if R is […]