On large bipartite graphs of diameter 3

DOI10.1016/j.disc.2012.11.013zbMath1259.05085arXiv1203.3588OpenAlexW1968868239MaRDI QIDQ1937548

Mirka Miller, Ramiro Feria-Purón, Guillermo Pineda-Villavicencio

Publication date: 1 March 2013

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1203.3588

zbMATH Keywords

defectdegree/diameter problem for bipartite graphsbipartite Moore boundlarge bipartite graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12) Vertex degrees (05C07)

Related Items (2)

On new record graphs close to bipartite Moore graphs ⋮ The degree/diameter problem for mixed abelian Cayley graphs

This page was built for publication: On large bipartite graphs of diameter 3