Edge Resolvability for Circular Ladder of Heptagons

Authors Jiabao Liu, S. K. Sharma, V. K. Bhat, Hassan Raza

Publication date 26 April 2021

Graph theory (including graph drawing) in computer science (68R10) General topics of discrete mathematics in relation to computer science (68R01) Distance in graphs (05C12)

Abstract: A set

m a t h b b Y

of elements (vertices or edges) in space is said to be a

g e n e r a t o r

of a metric space if each element of the space is recognized by its distances from the elements of

m a t h b b Y

, uniquely. The generator with minimum cardinality is known as the

b a s i s

of the metric space, and this cardinality is the

d i m e n s i o n

of the given space. In this article, we further discuss these notions with respect to a heptagonal circular ladder. We show that for a heptagonal circular ladder

G a m m a_{n}

, the edge metric dimension is three and find that it equals its metric dimension. We also introduce a new family of the convex polytope graph (denoted by

D e l t a_{n}

) from a heptagonal circular ladder and find its metric dimension. Furthermore, we prove that the minimum generator (metric and edge metric) are independent for all of these families of the convex polytopes.

This page was built for publication: Edge Resolvability for Circular Ladder of Heptagons

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6366128)