Global outer connected domination number of a graph

dc.contributor.author	Alishahi, M.
dc.contributor.author	Mojdeh, D.A.
dc.date.accessioned	2023-02-23T19:15:39Z
dc.date.available	2023-02-23T19:15:39Z
dc.date.issued	2018
dc.identifier.citation	Global outer connected domination number of a graph / M. Alishahi, D.A. Mojdeh // Algebra and Discrete Mathematics. — 2018. — Vol. 25, № 1. — С. 18-26. — Бібліогр.: 10 назв. — англ.	uk_UA
dc.identifier.issn	1726-3255
dc.identifier.other	2010 MSC: 05C69.
dc.identifier.uri	http://dspace.nbuv.gov.ua/handle/123456789/188344
dc.description.abstract	In this paper we obtain some bounds for outer connected domination numbers and global outer connected domination numbers of graphs.	uk_UA
dc.language.iso	en	uk_UA
dc.publisher	Інститут прикладної математики і механіки НАН України	uk_UA
dc.relation.ispartof	Algebra and Discrete Mathematics
dc.title	Global outer connected domination number of a graph	uk_UA
dc.type	Article	uk_UA
dc.status	published earlier	uk_UA