| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4647375 | Discrete Mathematics | 2014 | 8 Pages |
Abstract
A (k;g,h)-graph is a k-regular graph of girth pair (g,h) where g is the girth of the graph, h is the length of a smallest cycle of different parity than g and g
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
C. Balbuena, J. Salas,