2023
DOI: 10.5614/ejgta.2023.11.1.15
|View full text |Cite
|
Sign up to set email alerts
|

Moore mixed graphs from Cayley graphs

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

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 17 publications
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?