Sequence mixed graphs
Visualitza/Obre
Cita com:
hdl:2117/98676
Tipus de documentArticle
Data publicació2016-12
Condicions d'accésAccés obert
Llevat que s'hi indiqui el contrari, els
continguts d'aquesta obra estan subjectes a la llicència de Creative Commons
:
Reconeixement-NoComercial-SenseObraDerivada 3.0 Espanya
Abstract
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 general method for obtaining a sequence mixed diagraph by identifying some vertices of certain iterated line digraph. As a consequence, some results about distance-related parameters (mainly, the diameter and the average distance) of sequence mixed graphs are presented.
CitacióDalfo, C., Fiol, M., López, N. Sequence mixed graphs. "Discrete applied mathematics", Desembre 2016.
ISSN0166-218X
Versió de l'editorhttp://authors.elsevier.com/sd/article/S0166218X16305194
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
paper(rev2)27oct2016.pdf | 271,4Kb | Visualitza/Obre |