• Locating-dominating partitions...

Treffer: Locating-dominating partitions in graphs

Title:
Locating-dominating partitions in graphs
Authors:
Pelayo Melero, Ignacio Manuel, Hernando Martín, María del Carmen, Mora Giné, Mercè
Contributors:
Universitat Politècnica de Catalunya. Departament de Matemàtiques, Universitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions, Universitat Politècnica de Catalunya. DCCG - Grup de recerca en geometria computacional, combinatoria i discreta
Publication Year:
2016
Collection:
Universitat Politècnica de Catalunya, BarcelonaTech: UPCommons - Global access to UPC knowledge
Subject Terms:
Àrees temàtiques de la UPC::Informàtica::Infografia, Graph theory--Data processing, dominating partition, locating partition, coloring-locating partition, coloring-locating-dominating partition, Grafs, Teoria de
Document Type:
Konferenz conference object
File Description:
application/pdf
Language:
English
Relation:
http://www.mate.unlp.edu.ar/~liliana/lawclique_2016/prolist.pdf; http://hdl.handle.net/2117/104422
Availability:
http://hdl.handle.net/2117/104422
Rights:
Attribution-NonCommercial-NoDerivs 3.0 Spain ; http://creativecommons.org/licenses/by-nc-nd/3.0/es/ ; Open Access
Accession Number:
edsbas.CD4D6C60
Database:
BASE

Weitere Informationen

Let G = (V, E) be a connected graph of order n. Let ¿ = {S1, . . . , Sk} be a partition of V . Let r(u|¿) denote the vector of distances between a vertex v ¿ V and the elements of ¿, that is, r(v, ¿) = (d(v, S1), . . . , d(v, Sk)). The partition ¿ is called a locating partition of G if, for every pair of distinct vertices u, v ¿ V , r(u, ¿) 6= r(v, ¿). A locating partition ¿ is called metriclocating-dominating partition (an MLD-partition for short) of G if it is also dominating, ; Postprint (published version)