Mostra el registre d'ítem simple
Perfect and quasiperfect domination in trees
dc.contributor.author | Cáceres, José |
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.author | Puertas, Maria Luz |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Matemàtiques |
dc.date.accessioned | 2016-05-04T10:50:08Z |
dc.date.available | 2016-05-04T10:50:08Z |
dc.date.issued | 2016-04-25 |
dc.identifier.citation | Cáceres, José, Hernando, M., Mora, M., Pelayo, I. M., Luz Puertas, M. Perfect and quasiperfect domination in trees. "Applicable analysis and discrete mathematics", 25 Abril 2016, vol. 10, p. 46-64. |
dc.identifier.issn | 1452-8630 |
dc.identifier.uri | http://hdl.handle.net/2117/86561 |
dc.description.abstract | A k quasip erfect dominating set of a connected graph G is a vertex subset S such that every vertex not in S is adjacent to at least one and at most k vertices in S . The cardinality of a minimum k-quasip erfect dominating set in G is denoted by 1 k ( G ) . These graph parameters were rst intro duced by Chellali et al. (2013) as a generalization of b oth the p erfect domination numb er 11 ( G ) and the domination numb er ( G ) . The study of the so-called quasip erfect domination chain 11 ( G ) 12 ( G ) 1 ( G ) = ( G ) enable us to analyze how far minimum dominating sets are from b eing p erfect. In this pap er, we provide, for any tree T and any p ositive integer k , a tight upp er b ound of 1 k ( T ) . We also prove that there are trees satisfying all p ossible equalities and inequalities in this chain. Finally a linear algorithm for computing 1 k ( T ) in any tree T is presente |
dc.format.extent | 19 p. |
dc.language.iso | eng |
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.title | Perfect and quasiperfect domination in trees |
dc.type | Article |
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.identifier.doi | 10.2298/AADM160406007C |
dc.relation.publisherversion | http://pefmath.etf.rs/vol10num1/AADM-Vol10-No1-46-64.pdf |
dc.rights.access | Open Access |
local.identifier.drac | 17738846 |
dc.description.version | Postprint (published version) |
local.citation.author | Cáceres, José; Hernando, M.; Mora, M.; Pelayo, I. M.; Luz Puertas, M. |
local.citation.publicationName | Applicable analysis and discrete mathematics |
local.citation.volume | 10 |
local.citation.startingPage | 46 |
local.citation.endingPage | 64 |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Articles de revista [85]
-
Articles de revista [3.267]
-
Articles de revista [290]