Abstract
A mixed graph is said to be dense if its order is close to the Moore bound and it is optimal if there is not a mixed graph with the same parameters and bigger order. We present a construction that provides dense mixed graphs of undirected degree , directed degree and order , for being an odd prime power. Since the Moore bound for a mixed graph with these parameters is equal to the defect of these mixed graphs is . In particular we obtain a known mixed Moore graph of order , undirected degree and directed degree called Bosák's graph and a new mixed graph of order , undirected degree and directed degree , which is proved to be optimal.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.