An improved upper bound for the order of mixed graphs
MetadataShow full item record
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.
Is part ofDiscrete mathematics, october 2018, vol. 341, núm. 10, p. 2872-2877
European research projects
Showing items related by title, author, creator and subject.
Dalfó, Cristina; Fiol, Miguel Angel; López Lorenzo, Ignacio; Ryan, Joe (Elsevier, 2020)We consider the case in which mixed graphs (with both directed and undirected edges) are Cayley graphs of Abelian groups. In this case, some Moore bounds were derived for the maximum number of vertices that such graphs can ...
Dalfó, Cristina; Fiol, Miguel Angel; López Lorenzo, Ignacio (Elsevier, 2017)A mixed graph can be seen as a type of digraph containing some edges (or two opposite arcs). Here we introduce the concept of sequence mixed graphs, which is a generalization of both sequence graphs and iterated line ...
López Lorenzo, Ignacio; Pérez Rosés, Hebert; Pujolàs Boix, Jordi (Elsevier B.V., 2016-09-26)We give an upper bound for the number of vertices in mixed abelian Cayley graphs with given degree and diameter.