12 research outputs found
On perfect and quasiperfect dominations in graphs
Postprint (published version
Estudi bibliomètric any 2015. ESAB
El present document recull les publicacions indexades a la base de dades Scopus durant el perĂode comprès
entre el mesos de gener i desembre de l’any 2015, escrits per autors pertanyents a l’ESAB. Es presenten les
dades recollides segons la font on s’ha publicat, els autors que han publicat, i el tipus de document publicat.
S’hi inclou un annex amb la llista de totes les referències bibliogrà fiques publicades.Postprint (published version
Articles publicats per investigadors de l'ETSEIB. ProducciĂł cientĂfica a Futur 2015
Postprint (author's final draft
Articles publicats per investigadors de l'ETSEIB. ProducciĂł cientĂfica a Futur 2015
Postprint (author's final draft
Quasiperfect domination in trees
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.Peer Reviewe