Utilize este identificador para referenciar este registo: http://hdl.handle.net/10773/26713
Título: An overview of (k,t)-regular sets and their applications
Autor: Cardoso, Domingos M.
Palavras-chave: Perfect matching
Hamilton cycle
Efficient dominating set
Maximum k-regular induced subgraph
Graph spectra
Data: 30-Set-2019
Editora: Elsevier
Resumo: A (k,t)-regular set is a vertex subset S inducing a k-regular subgraph such that every vertex out of S has t neighbors in S. This article is an expository overview of the main results obtained for graphs with (k,t)-regular sets. The graphs with classical combinatorial structures, like perfect matchings, Hamilton cycles, efficient dominating sets, etc, are characterized by (k,t)-regular sets whose determination is equivalent to the determination of those classical combinatorial structures. The characterization of graphs with these combinatorial structures are presented. The determination of (k,t)-regular sets in a finite number of steps is deduced and the main spectral properties of these sets are described.
Peer review: yes
URI: http://hdl.handle.net/10773/26713
DOI: 10.1016/j.dam.2018.12.020
ISSN: 0166-218X
Aparece nas coleções: CIDMA - Artigos
DMat - Artigos
OGTCG - Artigos

Ficheiros deste registo:
Ficheiro Descrição TamanhoFormato 
1-s2.0-S0166218X18306632-main (4).pdf317.59 kBAdobe PDF    Acesso Restrito. Solicitar cópia ao autor!


FacebookTwitterDeliciousLinkedInDiggGoogle BookmarksMySpace
Formato BibTex MendeleyEndnote Degois 

Todos os registos no repositório estão protegidos por leis de copyright, com todos os direitos reservados.