The Degree/Diameter Problem for Mixed Abelian Cayley Graphs
This paper investigates the upper bounds for the number of vertices in mixed abelian Cayley graphs with given degree and diameter. Additionally, in the case when the undirected degree is equal to one, we give a construction that provides a lower bound.
| Autores: | , , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión aceptada para publicación |
| Fecha de publicación: | 2017 |
| País: | España |
| Institución: | Universitat de Lleida (UdL) |
| Repositorio: | Repositori Obert UdL |
| OAI Identifier: | oai:repositori.udl.cat:10459.1/62345 |
| Acceso en línea: | https://doi.org/10.1016/j.dam.2017.04.018 http://hdl.handle.net/10459.1/62345 |
| Access Level: | acceso abierto |
| Palabra clave: | Network design Degree/Diameter Problem Abelian Cayley graphs |
| Sumario: | This paper investigates the upper bounds for the number of vertices in mixed abelian Cayley graphs with given degree and diameter. Additionally, in the case when the undirected degree is equal to one, we give a construction that provides a lower bound. |
|---|