Mostra el registre d'ítem simple
On perfect and quasiperfect dominations in graphs
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 | Cáceres, José |
dc.contributor.author | Puertas, M. Luz |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Matemàtiques |
dc.date.accessioned | 2017-05-10T05:56:12Z |
dc.date.available | 2017-05-10T05:56:12Z |
dc.date.issued | 2017-02-27 |
dc.identifier.citation | Hernando, M., Mora, M., Pelayo, I. M., Cáceres, José, Puertas, M. L. On perfect and quasiperfect dominations in graphs. "Filomat", 27 Febrer 2017, vol. 31, núm. 2, p. 413-423. |
dc.identifier.issn | 0354-5180 |
dc.identifier.uri | http://hdl.handle.net/2117/104244 |
dc.description.abstract | A subset S ¿ V in a graph G = ( V , E ) is a k -quasiperfect dominating set (for k = 1) if 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 in G is denoted by ¿ 1 k ( G ). Those sets were first introduced by Chellali et al. (2013) as a generalization of the perfect domination concept and allow us to construct a decreasing chain of quasiperfect dominating numbers n = ¿ 11 ( G ) = ¿ 12 ( G ) = ... = ¿ 1 ¿ ( G ) = ¿ ( G ) in order to indicate how far is G from being perfectly dominated. In this paper we study properties, existence and realization of graphs for which the chain is short, that is, ¿ 12 ( G ) = ¿ ( G ). Among them, one can find cographs, claw-free graphs and graphs with extremal values of ¿ ( G ). |
dc.format.extent | 11 p. |
dc.language.iso | eng |
dc.rights | Attribution-NonCommercial-NoDerivs 3.0 Spain |
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 | claw-free graphs |
dc.subject.other | cograph |
dc.title | On perfect and quasiperfect dominations in graphs |
dc.type | Article |
dc.subject.lemac | Grafs, Teoria de |
dc.subject.lemac | Geometria discreta |
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 / FIL1702413C |
dc.relation.publisherversion | http://www.pmf.ni.ac.rs/pmf/publikacije/filomat/2017/31-2/31-2-20-2080.pdf |
dc.rights.access | Open Access |
local.identifier.drac | 19769258 |
dc.description.version | Postprint (published version) |
local.citation.author | Hernando, M.; Mora, M.; Pelayo, I. M.; Cáceres, José; Puertas, M. Luz |
local.citation.publicationName | Filomat |
local.citation.volume | 31 |
local.citation.number | 2 |
local.citation.startingPage | 413 |
local.citation.endingPage | 423 |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Articles de revista [85]
-
Articles de revista [3.234]
-
Articles de revista [290]