Mostra el registre d'ítem simple
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, M. Luz |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Matemàtiques |
dc.date.accessioned | 2016-04-05T09:39:49Z |
dc.date.available | 2017-12-01T01:30:21Z |
dc.date.issued | 2015-12-18 |
dc.identifier.citation | Cáceres, José, Hernando, M., Mora, M., Pelayo, I. M., Puertas, M. Luz. Quasiperfect domination in trees. "Electronic notes in discrete mathematics", 18 Desembre 2015, vol. 50, p. 439-444. |
dc.identifier.issn | 1571-0653 |
dc.identifier.uri | http://hdl.handle.net/2117/85175 |
dc.description.abstract | A k–quasiperfect dominating set ( k=1k=1) of a 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–quasiperfect dominating set of G is denoted by ¿1k(G)¿1k(G). Those sets were first introduced by Chellali et al. (2013) as a generalization of the perfect domination concept (which coincides with the case k=1k=1) and allow us to construct a decreasing chain of quasiperfect dominating parameters ¿11(G)=¿12(G)=…=¿1,¿(G)=¿(G),¿11(G)=¿12(G)=…=¿1,¿(G)=¿(G), (1) in order to indicate how far is G from being perfectly dominated. In this work, we study general properties, tight bounds, existence and realization results involving the parameters of the so-called QP-chain ( 1), for trees. |
dc.format.extent | 6 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.subject.other | Domination |
dc.subject.other | Perfect domination |
dc.subject.other | Quasiperfect domination |
dc.subject.other | Trees |
dc.title | 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.1016/j.endm.2015.07.073 |
dc.description.peerreviewed | Peer Reviewed |
dc.relation.publisherversion | http://www.sciencedirect.com/science/article/pii/S1571065315002280 |
dc.rights.access | Open Access |
local.identifier.drac | 17369887 |
dc.description.version | Postprint (author's final draft) |
local.citation.author | Cáceres, José; Hernando, M.; Mora, M.; Pelayo, I. M.; Puertas, M. Luz |
local.citation.publicationName | Electronic notes in discrete mathematics |
local.citation.volume | 50 |
local.citation.startingPage | 439 |
local.citation.endingPage | 444 |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Articles de revista [85]
-
Articles de revista [3.261]
-
Articles de revista [290]