Determination of (0,2)-regular sets in graphs and applications
In this paper, relevant results about the determination of (k,t)-regular sets, using the main eigenvalues of a graph, are reviewed and some results about the determination of (0,2)-regular sets are introduced. An algorithm for that purpose is also described. As an illustration, this algorithm is app...
| Autor principal: | |
|---|---|
| Outros Autores: | , |
| Formato: | bookPart |
| Idioma: | eng |
| Publicado em: |
2016
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/10773/15191 |
| País: | Portugal |
| Oai: | oai:ria.ua.pt:10773/15191 |
| Resumo: | In this paper, relevant results about the determination of (k,t)-regular sets, using the main eigenvalues of a graph, are reviewed and some results about the determination of (0,2)-regular sets are introduced. An algorithm for that purpose is also described. As an illustration, this algorithm is applied to the determination of maximum matchings in arbitrary graphs. |
|---|