On unicyclic graphs of metric dimension 2 with vertices of degree 4

dc.contributor.authorDudenko, Marharyta
dc.contributor.authorOliynyk, Bogdana
dc.date.accessioned2019-06-20T13:35:39Z
dc.date.available2019-06-20T13:35:39Z
dc.date.issued2018
dc.description.abstractWe show that if G is a unicyclic graph with metric dimension 2 and {a, b} is a metric basis of G then the degree of any vertex v of G is at most 4 and degrees of both a and b are at most 2. The constructions of unispider and semiunispider graphs and their knittings are introduced. Using these constructions all unicyclic graphs of metric dimension 2 with vertices of degree 4 are characterized.en_US
dc.identifier.citationDudenko M. On unicyclic graphs of metric dimension 2 with vertices of degree 4 / Dudenko M., Oliynyk B. // Algebra and Discrete Mathematics. - 2018. - Vol. 26, Issue 2. - P. 256-269.en_US
dc.identifier.issn2415-721X
dc.identifier.urihttps://ekmair.ukma.edu.ua/handle/123456789/15997
dc.language.isoenen_US
dc.relation.sourceAlgebra and Discrete Mathematics. - 2018. - Vol. 26, Issue 2en_US
dc.statuspublished earlieren_US
dc.subjectgraphen_US
dc.subjectdistanceen_US
dc.subjectmetric dimensionen_US
dc.subjectunicyclic graphen_US
dc.subjectarticleen_US
dc.titleOn unicyclic graphs of metric dimension 2 with vertices of degree 4en_US
dc.typeArticleen_US
Files
Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Dudenko_On_unicyclic_graphs_of_metric_dimension_2_with_vertices.pdf
Size:
339.82 KB
Format:
Adobe Portable Document Format
Description:
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: