Mostra el registre d'ítem simple

LD-graphs and global location-domination in bipartite graphs

dc.contributor.authorHernando Martín, María del Carmen
dc.contributor.authorMora Giné, Mercè
dc.contributor.authorPelayo Melero, Ignacio Manuel
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Matemàtica Aplicada I
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Matemàtica Aplicada II
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Matemàtica Aplicada III
dc.date.accessioned2014-10-31T12:08:44Z
dc.date.created2014-09-02
dc.date.issued2014-09-02
dc.identifier.citationHernando, M.; Mora, M.; Pelayo, I. M. LD-graphs and global location-domination in bipartite graphs. "Electronic notes in discrete mathematics", 02 Setembre 2014, vol. 46, p. 225-232.
dc.identifier.issn1571-0653
dc.identifier.urihttp://hdl.handle.net/2117/24527
dc.description.abstractA dominating set S of a graph G is a locating-dominating-set, 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, ¿(G)¿(G). An LD-set S of a graph G is global if it is an LD-set for both G and its complement, View the MathML sourceG¯. One of the main contributions of this work is the definition of the LD-graph, an edge-labeled graph associated to an LD-set, that will be very helpful to deduce some properties of location-domination in graphs. Concretely, we use LD-graphs to study the relation between the location-domination number in a bipartite graph and its complement.
dc.format.extent8 p.
dc.language.isoeng
dc.rightsAttribution-NonCommercial-NoDerivs 3.0 Spain
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.subjectÀrees temàtiques de la UPC::Matemàtiques i estadística
dc.subject.lcshBipartite graphs
dc.subject.otherdomination
dc.subject.otherlocation
dc.subject.othercomplement graph
dc.subject.otherbipartite graph
dc.titleLD-graphs and global location-domination in bipartite graphs
dc.typeArticle
dc.subject.lemacGrafs, Teoria de
dc.contributor.groupUniversitat Politècnica de Catalunya. DCCG - Grup de recerca en geometria computacional, combinatoria i discreta
dc.contributor.groupUniversitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions
dc.identifier.doi10.1016/j.endm.2014.08.030
dc.description.peerreviewedPeer Reviewed
dc.relation.publisherversionhttp://www.sciencedirect.com/science/article/pii/S1571065314000316#
dc.rights.accessRestricted access - publisher's policy
local.identifier.drac15259770
dc.description.versionPostprint (published version)
dc.date.lift10000-01-01
local.citation.authorHernando, M.; Mora, M.; Pelayo, I. M.
local.citation.publicationNameElectronic notes in discrete mathematics
local.citation.volume46
local.citation.startingPage225
local.citation.endingPage232


Fitxers d'aquest items

Imatge en miniatura
Nom:
1-s2.0-S1571065314000316-main.pdf
Mida:
202,6Kb
Format:
PDF
Visualitza/Obre

Aquest ítem apareix a les col·leccions següents

Mostra el registre d'ítem simple