A study on metric dimension of some families of graphs

Anuradha, A.; Amutha, B.

doi:10.1063/1.5112286

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2023

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Pizza graphs and complete split graphs metric dimension and distance metrics are addressed in [6]. Authors have addressed flower snark graph's Hamiltonian connectedness in [7,8].…”

Section: Introductionmentioning

confidence: 99%

On metric dimensions of flower graphs

Girisha,

Rajendra,

Vijaya Chandra Kumar

et al. 2023

J. Phys.: Conf. Ser.

View full text Add to dashboard Cite

The metric dimension of a connected graph G is the smallest number of nodes (resolving set) required to identify all other nodes based on shortest path distances uniquely. The notion of resolving set is vital in robotic navigation and to create various plan of action for the mastermind game. If certain vertices of a set S ⊂ V(G) resolve each pair of nodes u and v of G, then that set is a resolving set. A metric basis represents the lowest number of nodes in the set S. In this study, we describe the distance matrix and metric dimension of sunflower graphs and flower snarks.

show abstract

“…Pizza graphs and complete split graphs metric dimension and distance metrics are addressed in [6]. Authors have addressed flower snark graph's Hamiltonian connectedness in [7,8].…”

Section: Introductionmentioning

confidence: 99%