| Nome: | Descrição: | Tamanho: | Formato: | |
|---|---|---|---|---|
| 227.85 KB | Adobe PDF |
Orientador(es)
Resumo(s)
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.
Descrição
Palavras-chave
Maximum matching Main eigenvalues (0,2)-Regular sets
Contexto Educativo
Citação
Pacheco, Maria F.; Cardoso, Domingos Moreira; Luz, Carlos J. (2013). Determination of (0,2)-regular sets in graphs and applications. In MPE - DGS 2013 - Mathematics of Planet Earth - International Conference Planet Earth, Dynamics, Games and Science. Fundação Calouste Gulbenkian, Lisboa, Portugal