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.

Saved in:
Bibliographic Details
Published in:Discrete Applied Mathematics 2017-11, Vol.231, p.190-197
Main Authors: López, Nacho, Pérez-Rosés, Hebert, Pujolàs, Jordi
Format: Article
Language:English
Subjects:
Abelian Cayley graphs
Applied mathematics
Degree/Diameter Problem
Graphs
Network design
Upper bounds
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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