The Geodetic Local Resolving Number of Graphs

Main Article Content

R. Ananthakumar

Abstract

For an ordered vertex set W of a connected graph G, the code of a vertex is its distance vector with respect to W. A set W is called a geodetic local resolving set if it distinguishes every pair of adjacent vertices and is geodetic. The minimum cardinality of such a set is called the geodetic local metric dimension, denoted by glmd(G). In this paper, we establish sharp bounds for glmd(G), characterize the graphs attaining these bounds, investigate its relationship with several classical graph invariants.

Article Details

Section

Articles

How to Cite

The Geodetic Local Resolving Number of Graphs. (2026). Gulf Journal of Mathematics, 24(2). https://doi.org/10.56947/h5bwaw71