Cayley type graphs and cubic graphs of large girth
Discrete Mathematics
Error Control Coding, Second Edition
Error Control Coding, Second Edition
High girth column-weight-two LDPC codes based on distance graphs
EURASIP Journal on Wireless Communications and Networking
On the limitations of the use of solvable groups in Cayley graph cage constructions
European Journal of Combinatorics
Small vertex-transitive and Cayley graphs of girth six and given degree: an algebraic approach
Journal of Graph Theory
A recursive approach to low complexity codes
IEEE Transactions on Information Theory
A comparative study of parallel algorithms for the girth problem
AusPDC '12 Proceedings of the Tenth Australasian Symposium on Parallel and Distributed Computing - Volume 127
| Hi-index | 0.02 |
We study the potential and limitations of the voltage graph construction for producing small regular graphs of large girth. We determine the relation between the girth of the base graph and the lift, and we show that any base graph can be lifted to a graph of arbitrarily large girth. We determine upper bounds on the girths of voltage graphs with respect to the nilpotency class in the case of nilpotent groups or the length of the derived series in the case of solvable voltage groups. These results suggest the use of perfect groups, which we use to construct the smallest known cubic graphs of girths 29 and 30. We also construct the smallest known (5, 10)-graphs and (7, 8)-graphs.