7.1k citations
- S. Serjeant2 profiles60 · h 64
- C. Haswell31 · h 45
- G. White2 profiles31 · h 58
- C. Pearson2 profiles30 · h 40
- R. Street2 profiles29 · h 45
- C. Snodgrass2 profiles27 · h 51
- A. Norton25 · h 35
- T. Lister24 · h 44
- H. Dannerbauer2 profiles23 · h 69
- S. Dye2 profiles22 · h 63
- K. Horne2 profiles21 · h 73
- L. Dunne2 profiles21 · h 67
- Centre National de la Recherche ScientifiqueFR158 papers
- Rutherford Appleton LaboratoryGB103 papers
- Leiden UniversityNL95 papers
- European Southern ObservatoryCL94 papers
- University of OxfordGB93 papers
- Royal ObservatoryGB90 papers
- University of HertfordshireGB82 papers
- University of St AndrewsGB77 papers
- University of EdinburghGB75 papers
- Sorbonne UniversitéFR73 papers
- California Institute of TechnologyUS69 papers
- Center for Astrophysics Harvard & SmithsonianUS67 papers
Showing 2017 · math.COShow all
3 papers · 2 filters
math.CO2017★ 3 cited
Mixed Moore Cayley graphs
Grahame Erskine
The degree-diameter problem seeks to find the largest possible number of vertices in a graph having given diameter and given maximum degree. There has been much recent interest in…
math.CO2017
The spectra of lifted digraphs
C. Dalfó, M. A. Fiol, J. Širáň
We present a method to derive the complete spectrum of the lift of a base digraph , with voltage assignments on a (finite) group . The method is based on assigning to $…
math.CO2017★ 2 cited
On Hamilton Decompositions of Infinite Circulant Graphs
Darryn Bryant, Sarada Herke, Barbara Maenhaut +1
The natural infinite analogue of a (finite) Hamilton cycle is a two-way-infinite Hamilton path (connected spanning 2-valent subgraph). Although it is known that every connected $2k…