On local bipartite Moore graphs

• Nacho López ^[1] ; Josep Conde ^[1] ; Gabriela Araujo-Pardo ^[2]
  1. [1] Universitat de Lleida

     Universitat de Lleida

     Lérida, España

     
  2. [2] Universidad Nacional Autónoma de México

     Universidad Nacional Autónoma de México

     México

     
• Localización: Discrete Mathematics Days 2022 / Luis Felipe Tabera Alonso (ed. lit.), 2022, ISBN 978-84-19024-02-2, págs. 313-317
• Idioma: inglés
• Texto completo no disponible (Saber más ...)
• Resumen

  • Given the values of the maximum degree d and the (even) girth g of a bipartite graph,there is a natural lower bound for its number of vertices known as the bipartite Moore bound.Graphs attaining such a bound are referred to as bipartite Moore graphs. The fact that thereare very few bipartite Moore graphs suggests the definition of local bipartite Moore graphs.Here we consider the problem of classifying these graphs according to their ‘proximity’ tosome properties that a theoretical bipartite Moore graph should have.