Regularity, matchings and Cameron–Walker graphs

• Autores: Tran Nam Trung
• Localización: Collectanea mathematica, ISSN 0010-0757, Vol. 71, Fasc. 1, 2020, págs. 83-91
• Idioma: español
• DOI: 10.1007/s13348-019-00250-9
• Texto completo no disponible (Saber más ...)
• Resumen

  • Let G be a simple graph and let ?(?) be the matching number of G. It is well-known that reg?(?)⩽?(?)+1. In this paper we show that reg?(?)=?(?)+1 if and only if every connected component of G is either a pentagon or a Cameron–Walker graph.