Conference
Locating-dominating partitions in graphs
| Τίτλος: | Locating-dominating partitions in graphs |
|---|---|
| Συγγραφείς: | Pelayo Melero, Ignacio Manuel, Hernando Martín, María del Carmen, Mora Giné, Mercè |
| Συνεισφορές: | 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 |
| Έτος έκδοσης: | 2016 |
| Συλλογή: | Universitat Politècnica de Catalunya, BarcelonaTech: UPCommons - Global access to UPC knowledge |
| Θεματικοί όροι: | À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 |
| Περιγραφή: | 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) |
| Τύπος εγγράφου: | conference object |
| Περιγραφή αρχείου: | application/pdf |
| Γλώσσα: | English |
| Relation: | http://www.mate.unlp.edu.ar/~liliana/lawclique_2016/prolist.pdf; https://hdl.handle.net/2117/104422 |
| Διαθεσιμότητα: | https://hdl.handle.net/2117/104422 |
| Rights: | http://creativecommons.org/licenses/by-nc-nd/3.0/es/ ; Open Access ; Attribution-NonCommercial-NoDerivs 3.0 Spain |
| Αριθμός Καταχώρησης: | edsbas.CD4D6C60 |
| Βάση Δεδομένων: | BASE |
καταχωρήστε σχόλιο πρώτοι!