Publicação
Determination of (0,2)-regular sets in graphs and applications
| Resumo: | 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. |
|---|---|
| Autores principais: | Pacheco, Maria F. |
| Outros Autores: | Cardoso, Domingos M.; Luz, Carlos J. |
| Assunto: | Maximum matching Main eigenvalues (0,2)-Regular sets |
| Ano: | 2013 |
| País: | Portugal |
| Tipo de documento: | documento de conferência |
| Tipo de acesso: | acesso aberto |
| Instituição associada: | Instituto Politécnico de Bragança |
| Idioma: | português |
| Origem: | Biblioteca Digital do IPB |
| Resumo: | 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. |
|---|