On bipartite-mixed graphs

Visualitza/ Obre
Data de publicació
2018-04-04Citació recomanada
Dalfó, Cristina;
Fiol, Miguel Angel;
López Lorenzo, Ignacio;
.
(2018)
.
On bipartite-mixed graphs.
Journal of Graph Theory, 2018, núm. 89, p. 386-394.
https://doi.org/10.1002/jgt.22257.
Metadades
Mostra el registre d'unitat completResum
Mixed graphs can be seen as digraphs that have both arcs and edges (or digons, that is, two opposite arcs). In this arti- cle, we consider the case where such graphs are bipartite. As main results, we show that in this context the Moore- like bound is attained in the case of diameter k = 3, and that bipartite-mixed graphs of diameter k ≥ 4 do not exist.
És part de
Journal of Graph Theory, 2018, núm. 89, p. 386-394Projectes de recerca europeus
Col·leccions
Publicacions relacionades
Mostrant elements relacionats per títol, autor i matèria.
-
Sequence Mixed Graphs
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 ... -
An improved upper bound for the order of mixed graphs
Dalfó, Cristina; Fiol, Miguel Angel; López Lorenzo, Ignacio (Elsevier B.V., 2018)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 ... -
An improved Moore bound and some new optimal families of mixed Abelian Cayley graphs
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 ...