On unicyclic graphs of metric dimension 2

dc.contributor.author	Dudenko, M.
dc.contributor.author	Oliynyk, B.
dc.date.accessioned	2019-06-17T18:58:30Z
dc.date.available	2019-06-17T18:58:30Z
dc.date.issued	2017
dc.identifier.citation	On unicyclic graphs of metric dimension 2 / M. Dudenko, B. Oliynyk // Algebra and Discrete Mathematics. — 2017. — Vol. 23, № 2. — С. 216-222. — Бібліогр.: 11 назв. — англ.	uk_UA
dc.identifier.issn	1726-3255
dc.identifier.other	2010 MSC:05C12.
dc.identifier.uri	http://dspace.nbuv.gov.ua/handle/123456789/156023
dc.description.abstract	A metric basis S of a graph G is the subset of vertices of minimum cardinality such that all other vertices are uniquely determined by their distances to the vertices in S. The metric dimension of a graph G is the cardinality of the subset S. A unicyclic graph is a graph containing exactly one cycle. The construction of a knitting unicyclic graph is introduced. Using this construction all unicyclic graphs with two main vertices and metric dimensions 2 are characterized.	uk_UA
dc.language.iso	en	uk_UA
dc.publisher	Інститут прикладної математики і механіки НАН України	uk_UA
dc.relation.ispartof	Algebra and Discrete Mathematics
dc.title	On unicyclic graphs of metric dimension 2	uk_UA
dc.type	Article	uk_UA
dc.status	published earlier	uk_UA