The aim of this study is to compute the edge metric dimension of some subdivision of the wheel graphs. In particular, we determine and compare the metric and edge metric dimensions of the graphs obtained after the cycle, spoke and barycentric subdivisions of the wheel graph. Furthermore, some families of graphs have been constructed through subdivision process for which [Formula: see text], and also [Formula: see text] which partially answer a question in [A. Kelenc, N. Tratnik and I. G. Yero, Uniquely identifying the edges of a graph: The edge metric dimension, Discrete Appl. Math. 251 (2018) 204–220].

No abstract

Regular plane tessellations can easily be constructed by repeating regular polygons. This design is of extreme importance for direct interconnection networks as it yields high overall performance. The honeycomb and the hexagonal networks are two such popular mesh-derived parallel networks. The first and second Zagreb indices are among the most studied topological indices. We now consider analogous graph invariants, based on the second degrees of vertices, called Zagreb connection indices. The main objective of this paper is to compute these connection indices for the Hex, Hex derived and some Honeycomb networks.

No abstract