On the metric dimension of bipartite graphs
AbstractFor an ordered subset [Formula: see text] of vertices and a vertex v in a connected graph G, the ordered k-vector [Formula: see text] is called the representation of v with respect to W, where [Formula: see text] is the distance between v and wi, for [Formula: see text]. The set W is called...
Main Authors: | M. Anandha Jothi, K. Sankar |
---|---|
Format: | Article |
Language: | English |
Published: |
Taylor & Francis Group
2023-09-01
|
Series: | AKCE International Journal of Graphs and Combinatorics |
Subjects: | |
Online Access: | https://www.tandfonline.com/doi/10.1080/09728600.2023.2223248 |
Similar Items
-
On the Metric Dimension of Directed and Undirected Circulant Graphs
by: Vetrík Tomáš
Published: (2020-02-01) -
Star metric dimension of complete, bipartite, complete bipartite and fan graphs
by: Reni Umilasari, et al.
Published: (2022-06-01) -
Partition dimension of disjoint union of complete bipartite graphs
by: Debi Oktia Haryeni, et al.
Published: (2021-07-01) -
Edge metric dimension of some classes of circulant graphs
by: Ahsan Muhammad, et al.
Published: (2020-12-01) -
Metric dimension of fullerene graphs
by: Shehnaz Akhter, et al.
Published: (2019-04-01)