Abstract:A Moore (r, z, k)-mixed graph G has every vertex with undirected degree r, directed in-and outdegree z, diameter k, and number of vertices (or order) attaining the corresponding Moore bound M (r, z, k) for mixed graphs. When the order of G is close to M (r, z, k) vertices, we refer to it as an almost Moore graph. The first part of this paper is a survey about known Moore (and almost Moore) general mixed graphs that turn out to be Cayley graphs. Then, in the second part of the paper, we give new results on the … Show more
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.