Carregant...
Carregant...

Vés al contingut (premeu Retorn)

Symmetry breaking in tournaments

Autor
Lozano, A.
Tipus d'activitat
Article en revista
Revista
Electronic journal of combinatorics
Data de publicació
2013-03-24
Volum
20
Número
1, Paper 69
Pàgina inicial
1
Pàgina final
14
Projecte finançador
Biological and Social Data Mining: Algorithms, Theory, and Implementations (TIN2011-27479-C04-03)
MTM2011-28800-C02-01
Repositori
http://hdl.handle.net/2117/100103 Obrir en finestra nova
URL
http://www.combinatorics.org/ojs/index.php/eljc/article/view/v20i1p69 Obrir en finestra nova
Resum
We provide upper bounds for the determining number and the metric dimension of tournaments. A set of vertices S in V(T) is a determining set for a tournament T if every nontrivial automorphism of T moves at least one vertex of S, while S is a resolving set for T if every two distinct vertices in T have different distances to some vertex in S. We show that the minimum size of a determining set for an order n tournament (its determining number) is bounded by n/3, while the minimum size of a resolv...
Citació
Lozano, A. Symmetry breaking in tournaments. "Electronic journal of combinatorics", 24 Març 2013, vol. 20, núm. 1, Paper 69, p. 1-14.
Paraules clau
Determining number, Metric dimension, Tournament graphs
Grup de recerca
COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions

Participants

Arxius