| Autor: |
Dinny Fitriani, Anisa Rarasati, Suhadi Wido Saputro, Edy Tri Baskoro |
| Jazyk: |
angličtina |
| Rok vydání: |
2022 |
| Předmět: |
|
| Zdroj: |
Indonesian Journal of Combinatorics, Vol 6, Iss 1, Pp 50-57 (2022) |
| Druh dokumentu: |
article |
| ISSN: |
2541-2205 |
| DOI: |
10.19184/ijc.2022.6.1.3 |
| Popis: |
A set W is called a local resolving set of G if the distance of u and v to some elements of W are distinct for every two adjacent vertices u and v in G. The local metric dimension of G is the minimum cardinality of a local resolving set of G. A connected graph G is called a split graph if V(G) can be partitioned into two subsets V1 and V2 where an induced subgraph of G by V1 and V2 is a complete graph and an independent set, respectively. We also consider a graph, namely the unicyclic graph which is a connected graph containing exactly one cycle. In this paper, we provide a general sharp bounds of local metric dimension of split graph. We also determine an exact value of local metric dimension of any unicyclic graphs. |
| Databáze: |
Directory of Open Access Journals |
| Externí odkaz: |
|
