Carregant...
Carregant...

Vés al contingut (premeu Retorn)

Sequence mixed graphs

Autor
Dalfo, C.; Fiol, M.; López, N.
Tipus d'activitat
Article en revista
Revista
Discrete applied mathematics
Data de publicació
2016-12
Volum
219
Pàgina inicial
110
Pàgina final
116
DOI
https://doi.org/10.1016/j.dam.2016.10.030 Obrir en finestra nova
Repositori
http://hdl.handle.net/2117/98676 Obrir en finestra nova
URL
http://authors.elsevier.com/sd/article/S0166218X16305194 Obrir en finestra nova
Resum
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 literated line digraphs. These structures are proven to be useful in the problem of constructing dense graphs or digraphs, and this is related to the degree/diameter problem. Thus, our generalized approach gives rise to graphs that have also good ratio order/diameter. Moreover, we propose a gener...
Citació
Dalfo, C., Fiol, M., López, N. Sequence mixed graphs. "Discrete applied mathematics", Desembre 2016.
Paraules clau
Mixed Graph, Sequence Graph, Line Digraph, Degree/diameter Problem, Moore Bound, Diameter, Mean Distance
Grup de recerca
COMBGRAF - Combinatòria, Teoria de Grafs i Aplicacions

Participants

Arxius