Non-existence of bipartite graphs of diameter at least 4 and defect 2 |
| |
Authors: | Guillermo Pineda-Villavicencio |
| |
Institution: | 1.Centre for Informatics and Applied Optimization,University of Ballarat,Mount Helen,Australia |
| |
Abstract: | The Moore bipartite bound represents an upper bound on the order of a bipartite graph of maximum degree Δ and diameter D. Bipartite graphs of maximum degree Δ, diameter D and order equal to the Moore bipartite bound are called Moore bipartite graphs. Such bipartite graphs exist only if D=2,3,4 and 6, and for D=3,4,6, they have been constructed only for those values of Δ such that Δ−1 is a prime power. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|