Efficient domination through eigenvalues
The paper begins with a new characterization of (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,τ)-regular set. When τ = 1, this algorithm can be applied to solve the effici...
| Autor principal: | |
|---|---|
| Outros Autores: | , , |
| Formato: | article |
| Idioma: | eng |
| Publicado em: |
2018
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/10198/17357 |
| País: | Portugal |
| Oai: | oai:bibliotecadigital.ipb.pt:10198/17357 |