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.

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Discrete Applied Mathematics 2017-11, Vol.231, p.190-197
Hauptverfasser:	López, Nacho, Pérez-Rosés, Hebert, Pujolàs, Jordi
Format:	Artikel
Sprache:	eng
Schlagworte:	Abelian Cayley graphs Applied mathematics Degree/Diameter Problem Graphs Network design Upper bounds
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	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.
ISSN:	0166-218X 1872-6771
DOI:	10.1016/j.dam.2017.04.018