Local Metric Dimension of the Line Graph of a Generalized Petersen Graph

Let G be a graph that has a vertex set V(G) and an edge set E(G). Let W={w_1,w_2,…w_k} be a subset of V(G). The representation of a vertex v∈V(G) with respect to W, denoted by r(v|W), is defined as k-vector (d(v,w_1 ),d(v,w_2 ), …, d(v,w_k )). A set W is called a local resolving set of G if r(u│W)≠r(v│W) for every two adjacent vertices u,v∈V(G). The smallest cardinality of all local resolving set in G is called the local metric dimension of G, denoted by lmd(G). The local resolving set of G with cardinality lmd⁡(G) is called a local basis of G. In this paper, we determine the local metric dimension of the line graph of generalized Petersen graph P_(n,1).

Authors

Institutions

Publication Details

Journal
Proximal Jurnal Penelitian Matematika dan Pendidikan Matematika
Published
2024-10-21
DOI
https://doi.org/10.30605/proximal.v8i1.4707
Primary Topic
Graph Labeling and Dimension Problems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Local Metric Dimension of the Line Graph of a Generalized Petersen Graph

Nur Fahri Tadjuddin
Proximal Jurnal Penelitian Matematika dan Pendidikan Matematika
Graph Labeling and Dimension Problems
article

Local Metric Dimension of the Line Graph of a Generalized Petersen Graph

Nur Fahri Tadjuddin
article en

Abstract

Let G be a graph that has a vertex set V(G) and an edge set E(G). Let W={w_1,w_2,…w_k} be a subset of V(G). The representation of a vertex v∈V(G) with respect to W, denoted by r(v|W), is defined as k-vector (d(v,w_1 ),d(v,w_2 ), …, d(v,w_k )). A set W is called a local resolving set of G if r(u│W)≠r(v│W) for every two adjacent vertices u,v∈V(G). The smallest cardinality of all local resolving set in G is called the local metric dimension of G, denoted by lmd(G). The local resolving set of G with cardinality lmd⁡(G) is called a local basis of G. In this paper, we determine the local metric dimension of the line graph of generalized Petersen graph P_(n,1).

Proximal Jurnal Penelitian Matematika dan Pendidikan MatematikaVol. 8(1)
Universitas Sulawesi Barat (ID)
Openalex Percentile: Top 68%
Graph Labeling and Dimension Problems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.