| Nome: | Descrição: | Tamanho: | Formato: | |
|---|---|---|---|---|
| 215.36 KB | Adobe PDF |
Orientador(es)
Resumo(s)
A (k,tau)- regular set in a graph is a subset of vertices inducing a tau-regular subgraph and such that
each vertex not in the set has exactly tau 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
(0,2)-Regular sets Main eigenvalues Walk matrix
Contexto Educativo
Citação
Pacheco, Maris F.; Cardoso, Domingos; Luz, Carlos (2014). Determination of (0,2)-regular sets in graphs and applications. In 3rd International Conference on Dynamics, Game and Science. Porto, Portugal