On the Characterization of a Minimal Resolving Set for Power of Paths

On the Characterization of a Minimal Resolving Set for Power of Paths

For a simple connected graph <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>G</mi><mo>=</mo><mo>(</mo><mi>V</mi><mo>,</mo><mi>E</mi...

Full description

Bibliographic Details
Main Authors: Laxman Saha, Mithun Basak, Kalishankar Tiwary, Kinkar Chandra Das, Yilun Shang
Format: Article
Language:English
Published: MDPI AG 2022-07-01
Series:Mathematics
Subjects:
graph
code
resolving set
metric dimension
Online Access:https://www.mdpi.com/2227-7390/10/14/2445

Internet

https://www.mdpi.com/2227-7390/10/14/2445

Similar Items