Autor(es): Pacheco, Maria F. ; Cardoso, Domingos M. ; Luz, Carlos J.
Data: 2013
Identificador Persistente: http://hdl.handle.net/10198/10762
Origem: Biblioteca Digital da UPB
Assunto(s): Maximum matching; Main eigenvalues; (0,2)-Regular sets
Autor(es): Pacheco, Maria F. ; Cardoso, Domingos M. ; Luz, Carlos J.
Data: 2013
Identificador Persistente: http://hdl.handle.net/10198/10762
Origem: Biblioteca Digital da UPB
Assunto(s): Maximum matching; Main eigenvalues; (0,2)-Regular sets
A (k,τ)-regular set in a graph is a subset of vertices inducing a k-regular subgraph and such that each vertex not in the set has exactly τ neighbours in it. We will present a new algorithm for the determination of (0,2)-regular sets as well as its application to the determination of maximum matchings in arbitrary graphs.