Locating domination in graphs and their complements
A dominating set S of a graph G is called locating-dominating , LD-set for short, if every vertex v not in S is uniquely determined by the set of neighbors of v belonging to S . Locating-dominating sets of minimum cardinality are called LD -codes and the cardinality of an LD-code is the location-dom...
| Autores: | , , |
|---|---|
| Formato: | capítulo de livro |
| Fecha de publicación: | 2013 |
| País: | España |
| Recursos: | 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/21284 |
| Acesso em linha: | https://hdl.handle.net/2117/21284 |
| Access Level: | acceso abierto |
| Palavra-chave: | Grafs, Teoria de -- Informàtica Àrees temàtiques de la UPC::Matemàtiques i estadística |
| Resumo: | A dominating set S of a graph G is called locating-dominating , LD-set for short, if every vertex v not in S is uniquely determined by the set of neighbors of v belonging to S . Locating-dominating sets of minimum cardinality are called LD -codes and the cardinality of an LD-code is the location-domination number . An LD-set of a graph G is global if S is an LD-set of both G and its complement, G . In this work, we give some relations between the locating-dominating sets and location-domination number in a graph and its complement |
|---|