This is a survey of distance-regular graphs. We present an introduction to distance-regular
graphs for the reader who is unfamiliar with the subject, and then give an overview of some …

The base size of a permutation group, and the metric dimension of a graph, are two of a
number of related parameters of groups, graphs, coherent configurations and association …

The metric dimension of a graph is the smallest number of nodes required to identify all
other nodes uniquely based on shortest path distances. Applications of metric dimension …

Every node in a network is said to be resolved if it can be uniquely identified by a vector of
distances to a specific set of nodes. The metric dimension is equivalent to the least possible …

On the metric dimension of Grassmann graphs Page 1 Discrete Mathematics and
Theoretical Computer Science DMTCS vol. 13:4, 2011, 97–104 On the metric dimension of …

Irregular convex triangular networks consist of the interior of a 6-sided convex polygon
drawn on the infinite triangular network. Formal description of these applicable networks is …

Let G be a connected graph. Brigham et al.[3] defined a resolving dominating setas a set S
of vertices of a connected graph G that is both resolving and dominating. A set S ⊆ V (G) is …

A subset Δ of non-negative integers N 0 is called a numerical semigroup if it is a submonoid
of N 0 and has a finite complement in N 0. A graph G Δ is called a Δ (α, β)-graph if there …

A resolving set of a graph is a set of vertices with the property that the list of distances from
any vertex to those in the set uniquely identifies that vertex. In this paper, we construct a …

This paper considers the following three Roman domination graph invariants on Kneser
graphs: Roman domination, total Roman domination, and signed Roman domination. For …