Resumen de Regularity, matchings and Cameron–Walker graphs

Tran Nam Trung

• 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.