Locating domination in graphs and their complements

Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel

View/Open

VIIIEAMDMerceMora.pdf (96,74Kb)

View Usage Statistics

Cita com:

Show full item record

Hernando Martín, María del Carmen

Mora Giné, Mercè

Pelayo Melero, Ignacio Manuel

Document typePart of book or chapter of book

Defense date2013-10-16

PublisherUniversidad de Sevilla

Rights accessOpen Access

Abstract

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

CitationHernando, M.; Mora, M.; Pelayo, I. Locating domination in graphs and their complements. A: "Avances en Matem atica Discreta en Andaluc a (Vol. III)". Sevilla: Universidad de Sevilla, 2013, p. 183-190.

URIhttp://hdl.handle.net/2117/21284

ISBN978-84-15881-46-9

Collections

View Usage Statistics

Show full item record

Files	Description	Size	Format	View
VIIIEAMDMerceMora.pdf		96,74Kb	PDF	View/Open

Except where otherwise noted, content on this work is licensed under a Creative Commons license : Attribution-NonCommercial-NoDerivs 3.0 Spain

UPCommons. Global access to UPC knowledge

Locating domination in graphs and their complements

View/Open

Browse