On the Partition Dimension and the Twin Number of a Graph
A partition of the vertex set of a connected graph G is a locating partition of G if every vertex is uniquely determined by its vector of distances to the elements of . The partition dimension of G is the minimum cardinality of a locating partition of G . A pair of vertices u;v of a graph G are call...
| Autores: | , , |
|---|---|
| Tipo de recurso: | informe técnico |
| Fecha de publicación: | 2016 |
| País: | España |
| Institución: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/87267 |
| Acceso en línea: | https://hdl.handle.net/2117/87267 |
| Access Level: | acceso abierto |
| Palabra clave: | Graph theory locating set locating partition metric dimension partition dimension twin number Grafs, Teoria de Àrees temàtiques de la UPC::Matemàtiques i estadística |
| Sumario: | A partition of the vertex set of a connected graph G is a locating partition of G if every vertex is uniquely determined by its vector of distances to the elements of . The partition dimension of G is the minimum cardinality of a locating partition of G . A pair of vertices u;v of a graph G are called twins if they have exactly the same set of neighbors other than u and v . A twin class is a maximal set of pairwise twin vertices. The twin number of a graph G is the maximum cardinality of a twin class of G . In this paper we undertake the study of the partition dimension of a graph by also considering its twin number. This approach allows us to obtain the set of connected graphs of order n 9 having partition dimension n |
|---|