Mostra el registre d'ítem simple
Locating domination in bipartite graphs and their complements
dc.contributor.author | Hernando Martín, María del Carmen |
dc.contributor.author | Mora Giné, Mercè |
dc.contributor.author | Pelayo Melero, Ignacio Manuel |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Matemàtiques |
dc.date.accessioned | 2017-11-22T12:08:39Z |
dc.date.available | 2017-11-22T12:08:39Z |
dc.date.issued | 2017-11-03 |
dc.identifier.citation | Hernando, M., Mora, M., Pelayo, I. M. "Locating domination in bipartite graphs and their complements". 2017. |
dc.identifier.uri | http://hdl.handle.net/2117/111067 |
dc.description.abstract | A set S of vertices of a graph G is distinguishing if the sets of neighbors in S for every pair of vertices not in S are distinct. A locating-dominating set of G is a dominating distinguishing set. The location-domination number of G , ¿ ( G ), is the minimum cardinality of a locating-dominating set. In this work we study relationships between ¿ ( G ) and ¿ ( G ) for bipartite graphs. The main result is the characterization of all connected bipartite graphs G satisfying ¿ ( G ) = ¿ ( G ) + 1. To this aim, we define an edge-labeled graph G S associated with a distinguishing set S that turns out to be very helpful |
dc.format.extent | 14 p. |
dc.language.iso | eng |
dc.rights | Attribution-NonCommercial-NoDerivs 3.0 Spain |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/3.0/es/ |
dc.subject | Àrees temàtiques de la UPC::Matemàtiques i estadística |
dc.subject.lcsh | Graph theory |
dc.subject.other | domination |
dc.subject.other | location |
dc.subject.other | distinguishing set |
dc.subject.other | locating domination |
dc.subject.other | complement graph |
dc.subject.other | bipartite graph |
dc.title | Locating domination in bipartite graphs and their complements |
dc.type | External research report |
dc.subject.lemac | Grafs, Teoria de |
dc.contributor.group | Universitat Politècnica de Catalunya. DCCG - Grup de recerca en geometria computacional, combinatoria i discreta |
dc.contributor.group | Universitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions |
dc.subject.ams | Classificació AMS::05 Combinatorics::05C Graph theory |
dc.relation.publisherversion | https://arxiv.org/pdf/1711.01951.pdf |
dc.rights.access | Open Access |
local.identifier.drac | 21602972 |
dc.description.version | Postprint (author's final draft) |
local.citation.author | Hernando, M.; Mora, M.; Pelayo, I. M. |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Reports de recerca [14]
-
Reports de recerca [403]
-
Reports de recerca [40]