On Bipartite Cages of Excess 4

Electronic Journal Of Combinatorics

Slobodan Filipovski¹ 

关键词: Cage problem;    Bipartite graphs;    Cyclic excess;    Bicyclic excess;   

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

The Moore bound $M(k,g)$ is a lower bound on the order of $k$-regular graphs of girth $g$ (denoted $(k,g)$-graphs). The excess $e$ of a $(k,g)$-graph of order $n$ is the difference $ n-M(k,g) $. In this paper we consider the existence of $(k,g)$-bipartite

【 授权许可】

Others