Work

Metric basis and metric dimension of some infinite planar graphs

Year: 2024

Type: article

Abstract: Let [Formula: see text] be a nontrivial connected simple graph and [Formula: see text] be the distance between the vertices [Formula: see text] and [Formula: see text] in [Formula: see text]. The metric dimension of a graph [Formula: see text], denoted by dim([Formula: see text]), refers to the smallest set of vertices required to uniquely identify every vertex in the graph [Formula: see text]. A family of simple connected graphs say [Formula: see text], where [Formula: see text] has a constant metric dimension, if dim[Formula: see text] is finite and does not depend on the choice of [Formula: see text] in [Formula: see text]. In this paper, we consider two infinite families of planar graphs, say [Formula: see text], where [Formula: see text] and [Formula: see text], where [Formula: see text], and investigate their metric basis as well as the metric dimension. Additionally, we prove that the metric basis for these two graphs are independent.

Source: Discrete Mathematics Algorithms and Applications

DOI: 10.1142/s1793830924500769

Authors: S. Vidya, Sunny Kumar Sharma, Prasanna Poojary, G. R. Vadiraja Bhatta

Institution: Manipal Academy of Higher Education

Language: English

Topic: Graph Labeling and Dimension Problems

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: hybrid

OpenAlex ID: W4401720481

FWCI: 0.391

Cites: 17

Cited by: 2

Related to: 10