## On k-dimensional graphs and their bases

Published in Periodica Mathematica Hungarica

Published in Periodica Mathematica Hungarica

Published in Czechoslovak Mathematical Journal

For an ordered set W = {w1, w2,..., wk} of vertices and a vertex v in a connected graph G, the representation of v with respect to W is the k-vector r(v|W) = (d(v, w1), d(v, w2),... d(v, wk)), where d(x, y) represents the distance between the vertices x and y. The set W is a resolving set for G if distinct vertices of G have distinct representation...

Recently upper bounds on the metric dimension of Grassmann graphs, bilinear forms graphs, doubled Grassmann graphs and twisted Grassmann graphs have been obtained by Bailey, Meagher, Feng and the present authors. In this paper, we continue this research and construct resolving sets with smaller sizes for these graphs. As a result, we improve the kn...

mC2n + k1 by alternatively deleting n spokes of each copy of C2n and J3n be a generalized gear graph obtained by alternately deleting 2n spokes of the wheel graph W3n. In this paper, the metric dimension of certain gear graphs J2n,m and J3n generated by wheel has been computed. Also this study extends the previous result given by Tomescu et al. in ...

s have attracted attention due to their transport properties, electronic structure and structural stability. In the present article, we compute the metric dimension and metric basis of 2D lattices of alpha-boron nanotubes.

{s} is a resolving set. The secure resolving domination number is defined, and its value is found for several classes of graphs. The characterization of graphs with specific secure resolving domination number is also done.

Let G = (V, E) be a connected graph and d(x, y) be the distance between the vertices x and y in G. A set of vertices W resolves a graph G if every vertex is uniquely determined by its vector of distances to the vertices in W. A metric dimension of G is the minimum cardinality of a resolving set of G and is denoted by dim(G). In this paper, Cycle, P...

Let G = (V, E) be a connected graph, let x ∈ V (G) be a vertex and e = yz ∈ E(G) be an edge. The distance between the vertex x and the edge e is given by d G (x, e) = min{d G (x, y), d G (x, z)}. A vertex t ∈ V (G) distinguishes two edges e, f ∈ E(G) if d G (t, e) = d G (t, f). A set R ⊆ V (G) is an edge metric generator for G if every two edges of...

In this paper, we consider fault-tolerant resolving sets in graphs. We characterize n-vertex graphs with fault-tolerant metric dimension n, n &minus / 1 , and 2, which are the lower and upper extremal cases. Furthermore, in the first part of the paper, a method is presented to locate fault-tolerant resolving sets by using classical resolving sets i...

Let G = ( V ( G ) , E ( G ) ) be a connected graph. An ordered set W &sub / V ( G ) is a resolving set for G if every vertex of G is uniquely determined by its vector of distances to the vertices in W. The metric dimension of G is the minimum cardinality of a resolving set. In this paper, we characterize the graphs of metric dimension n &minus / 3 ...