Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1016/j.dam.2017.04.018 | Discrete Applied Mathematics |
Keywords | Field | DocType |
Network design,Degree/Diameter Problem,Abelian Cayley graphs | Abelian group,Discrete mathematics,Combinatorics,Elementary abelian group,Vertex (geometry),Cayley table,Upper and lower bounds,Cayley graph,Cayley transform,Mathematics,Degree diameter problem | Journal |
Volume | ISSN | Citations |
231 | 0166-218X | 2 |
PageRank | References | Authors |
0.39 | 11 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nacho López | 1 | 43 | 9.42 |
| Hebert Pérez-rosés | 2 | 53 | 11.04 |
| Jordi Pujolàs | 3 | 24 | 5.98 |