Evènement pour le groupe GT Graphes et Applications
|Date|| 2015-02-20 14:00-15:00|
|Titre||Symmetry breaking, resolvability and locating-domination in graphs |
|Résumé||A resolving set is a subset of the vertices of a graph such that all other vertices are uniquely determined by their distances to those vertices. The only automorphism of the graph fixing a resolving set is the identity. In general, it is possible to find subsets of vertices with this property (of “destroying” all the automorphisms) and with smaller cardinality than all the resolving sets in the graph; these are cases of determining sets.
In this talk, we are going to deal with determining sets and resolving sets. When considering these sets in certain families of graphs, many interesting combinatorial objects can arise; for instance, partial geometries and toroidal grids. Further, the relationship between them leads us to study the so called locating-dominating sets and their relationships with other graph structures such as k-dominating sets and matchings. |
|Lieu||Salle 178 |
|Orateur||Antonio González |
Aucun document lié à cet événement.RetourRetour à l'index