Domination on the vertices of labeled graphs

dc.contributor.author	Grunsky, I.
dc.contributor.author	Mikhaylova, I.
dc.contributor.author	Sapunov, S.
dc.date.accessioned	2019-06-09T06:06:28Z
dc.date.available	2019-06-09T06:06:28Z
dc.date.issued	2012
dc.identifier.citation	Domination on the vertices of labeled graphs / I. Grunsky, I. Mikhaylova, S. Sapunov // Algebra and Discrete Mathematics. — 2012. — Vol. 14, № 2. — С. 174–184. — Бібліогр.: 13 назв. — англ.	uk_UA
dc.identifier.issn	1726-3255
dc.identifier.other	2010 MSC:68Q45, 68R10.
dc.identifier.uri	http://dspace.nbuv.gov.ua/handle/123456789/152237
dc.description.abstract	In this paper we introduce and study a domination relation on vertices of vertex-labeled graphs induced by vertex languages comparison. An effective method of checking this relation is developed. Properties of vertices maximal by this relation are investigated. It is shown that dominating vertices form a connected component of the graph.	uk_UA
dc.language.iso	en	uk_UA
dc.publisher	Інститут прикладної математики і механіки НАН України	uk_UA
dc.relation.ispartof	Algebra and Discrete Mathematics
dc.title	Domination on the vertices of labeled graphs	uk_UA
dc.type	Article	uk_UA
dc.status	published earlier	uk_UA