Can I read An improved Moore bound for mixed graphs on EtoBox?

An improved Moore bound for mixed graphs by Dalfó, C.; Fiol, M. A.; López, N. is a scholarly article available to read on EtoBox.

What is An improved Moore bound for mixed graphs about?

A mixed graph $G$ can contain both (undirected) edges and arcs (directed edges). Here we derive an improved Moore-like bound for the maximum number of vertices of a mixed graph with diameter at least three. Moreover, a complete enumeration of all optimal $(1,1)$-regular mixed graphs with diameter three is presented, so proving that, in general, the proposed bound cannot be improved.

Author

Dalfó, C.; Fiol, M. A.; López, N.

Published

2016

Language

EN