Abstract
. Suppose that is the Cayley graph whose vertices are all elements of and two vertices and are adjacent if and only if . In this paper,we introduce the generalized Cayley graph denoted by which is a graph with a vertex set consisting of all column matrices in which all components are in and two vertices and are adjacent if and only if , where is a column matrix that each entry is the inverse of the similar entry of and is matrix with all entries in , is the transpose of and and m . We aim to provide some basic properties of the new graph and determine the structure of when is a complete graph for every , and n, m .
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
