Efficient domination through eigenvalues
The paper begins with a new characterization of (k,τ)(k,τ)-regular sets. Then, using this result as well as the theory of star complements, we derive a simplex-like algorithm for determining whether or not a graph contains a (0,τ)(0,τ)-regular set. When τ=1τ=1, this algorithm can be applied to solve...
| Autor principal: | |
|---|---|
| Outros Autores: | , , |
| Formato: | article |
| Idioma: | eng |
| Publicado em: |
1000
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/10773/16157 |
| País: | Portugal |
| Oai: | oai:ria.ua.pt:10773/16157 |