On the total k-domination in graphs

Hernández Gómez, Juan Carlos; Sigarreta Almira, José María

dc.contributor.author	Hernández Gómez, Juan Carlos
dc.contributor.author	Sigarreta Almira, José María
dc.creator	Hernández Gómez, Juan Carlos; 41174
dc.creator	Sigarreta Almira, José María; 252021
dc.date.accessioned	2019-05-20T08:20:45Z
dc.date.available	2019-05-20T08:20:45Z
dc.date.issued	2018-01
dc.identifier.uri	http://ri.uagro.mx/handle/uagro/821
dc.description.abstract	Let G = (V, E) be a graph; a set S V is a total k-domination number (G) is the minimum cardinality among all total k-dominating sets. In this paper we obtain several tight bounds for the total k-domination number of a graph. In particular, we investigate the relationship between the total k-domination number of a graph and the order, the size, the girth, the minimum and maximum degree, the diameter, and other domination parameters of the graph.
dc.format	pdf
dc.language.iso	eng
dc.publisher	Discussiones Mathematicae
dc.rights.uri	http://creativecommons.org/licenses/by-nc-nd/4
dc.subject	UNESCO Thesaurus /k-domination
dc.subject	UNESCO Thesaurus /Total k-domination
dc.subject	UNESCO Thesaurus /K-tuple domination
dc.subject	UNESCO Thesaurus /K-tuple total domination
dc.subject.classification	CIENCIAS FÍSICO MATEMÁTICAS Y CIENCIAS DE LA TIERRA::MATEMÁTICAS
dc.title	On the total k-domination in graphs
dc.type	Artículo
dc.type.conacyt	article
dc.rights.acces	openAccess
dc.audience	generalPublic
dc.identificator	1\|\|12
dc.format.digitalOrigin	Born digital
dc.thesis.degreename	Maestría en Ciencias Matemáticas
dc.thesis.degreedepartment	Facultad de Matemáticas
dc.identifier.cvuagro	14365
dc.identifier.doi	https://doi:10.7151/dmgt.2016