On unicyclic graphs of metric dimension 2

Simple item page
dc.contributor.authorDudenko, Marharyta
dc.contributor.authorOliynyk, Bogdana
dc.date.accessioned2018-06-06T10:13:11Z
dc.date.available2018-06-06T10:13:11Z
dc.date.issued2017
dc.description.abstractA 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.en_US
dc.identifier.citationDudenko M. On unicyclic graphs of metric dimension 2 / Marharyta Dudenko, Bogdana Oliynyk ; communicated by A. P. Petravchuk // Algebra and Discrete Mathematics. - 2017. - Vol. 23, no. 2. - P. 216-222.en_US
dc.identifier.issn1726-3255
dc.identifier.urihttps://ekmair.ukma.edu.ua/handle/123456789/13214
dc.language.isoenen_US
dc.relation.sourceAlgebra and Discrete Mathematics. - 2017. - Vol. 23, no. 2en_US
dc.statusfirst publisheden_US
dc.subjectdistanceen_US
dc.subjectmetric dimensionsen_US
dc.subjectunicyclic graphen_US
dc.subjectarticleen_US
dc.titleOn unicyclic graphs of metric dimension 2en_US
dc.typeArticleen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
On_unicyclic_graphs_of_metric_dimension_2.pdf
Size:
230.4 KB
Format:
Adobe Portable Document Format
Description:
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
7.54 KB
Format:
Item-specific license agreed upon to submission
Description:
Download
Collections
Кафедра математики