| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4646663 | Discrete Mathematics | 2016 | 10 Pages |
Abstract
A graph of girth gg that contains vertices of degrees rr and mm is called a bi-regular ({r,m},g)({r,m},g)-graph. As with the Cage Problem , we seek the smallest ({r,m},g)({r,m},g)-graphs for given parameters 2≤r
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Gabriela Araujo-Pardo, Geoffrey Exoo, Robert Jajcay,