Sequence mixed graphs
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...
| Autores: | , , |
|---|---|
| Tipo de recurso: | artículo |
| Fecha de publicación: | 2016 |
| País: | España |
| Institución: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/98676 |
| Acceso en línea: | https://hdl.handle.net/2117/98676 https://dx.doi.org/10.1016/j.dam.2016.10.030 |
| Access Level: | acceso abierto |
| Palabra clave: | Graph theory Algebra Mixed graph Sequence graph Line digraph Degree/diameter problem Moore bound Diameter Mean distance Grafs, Teoria de Àrees temàtiques de la UPC::Matemàtiques i estadística::Àlgebra::Àlgebra lineal i multilineal |
| Sumario: | 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. |
|---|