Related papers: On the metric dimension of imprimitive distance-re…

A resolving set in a graph $G$ is a vertex subset $W= \{\omega^1, \dots, \omega^n\} \subseteq V(G)$ such that each $u \in V(G)$ can be uniquely identified by the vector $r(u \vert W) = (d(u,\omega^1), \dots, d(u,\omega^n))$ of metric…

For a connected graph $G$ and $\alpha\in [0,1)$, the distance $\alpha$-spectral radius of $G$ is the spectral radius of the matrix $D_{\alpha}(G)$ defined as $D_{\alpha}(G)=\alpha T(G)+(1-\alpha)D(G)$, where $T(G)$ is a diagonal matrix of…

The regular graph of ideals of the commutative ring $R$, denoted by ${\Gamma_{reg}}(R)$, is a graph whose vertex set is the set of all non-trivial ideals of $R$ and two distinct vertices $I$ and $J$ are adjacent if and only if either $I$…

A piece of a labelled graph $\Gamma$ defined by D. Gruber is a labelled path that embeds into $\Gamma$ in two essentially different ways. We prove that graphical $Gr'(\frac{1}{6})$ small cancellation groups whose associated pieces have…

We prove that, if $\Gamma$ is a finite connected $3$-valent vertex-transitive, or $4$-valent vertex- and edge-transitive graph, then either $\Gamma$ is part of a well-understood family of graphs, or every non-identity automorphism of…

Let $(X,d)$ be a metric space. A set $S\subseteq X$ is said to be a $k$-metric generator for $X$ if and only if for any pair of different points $u,v\in X$, there exist at least $k$ points $w_1,w_2, \ldots w_k\in S$ such that $d(u,w_i)\ne…

A resolving set for a simple graph $G$ is a subset of vertex set of $G$ such that it distinguishes all vertices of $G$ using the shortest distance from this subset. This subset is a metric basis if it is the smallest set with this property.…

We explore a reconfiguration version of the dominating set problem, where a dominating set in a graph $G$ is a set $S$ of vertices such that each vertex is either in $S$ or has a neighbour in $S$. In a reconfiguration problem, the goal is…

Let PG$(\mathbb{F}_q^v)$ be the $(v-1)$-dimensional projective space over $\mathbb{F}_q$ and let $\Gamma$ be a simple graph of order ${q^k-1\over q-1}$ for some $k$. A 2$-(v,\Gamma,\lambda)$ design over $\mathbb{F}_q$ is a collection $\cal…

Given a finite group $G$, denote by $\Gamma(G)$ the simple undirected graph whose vertices are the distinct sizes of noncentral conjugacy classes of $G$, and set two vertices of $\Gamma(G)$ to be adjacent if and only if they are not coprime…

A signed graph $\Sigma$ is a pair $(G,\sigma)$, where $G=(V,E)$ is the underlying graph in which each edge is assigned $+1$ or $-1$ by the signature function $\sigma:E\rightarrow\{-1,+1\}$. In this paper, we extend the extensively applied…

Let $n$ be a positive integer, $q$ be a prime power, and $V$ be a vector space of dimension $n$ over $\mathbb{F}_q$. Let $G := V \rtimes G_0$, where $G_0$ is an irreducible subgroup of ${\rm GL}(V)$ which is maximal by inclusion with…

Let $G$ be a finite, connected graph of order of at least 2, with vertex set $V(G)$ and edge set $E (G)$. A set $S$ of vertices of the graph $G$ is a doubly resolving set for $G$ if every two distinct vertices of $G$ are doubly resolved by…

The nilpotent graph of a group $G$ is the simple and undirected graph whose vertices are the elements of $G$ and two distinct vertices are adjacent if they generate a nilpotent subgroup of $G$. Here we discuss some topological properties of…

Let $G$ be a finite, connected, undirected, and simple graph and $W$ be a set of vertices in $G$. A representation multiset of a vertex $u$ in $V(G)$ with respect to $W$ is defined as the multiset of distances between $u$ and the vertices…

Let ${\cal G}$ be a graph family defined on a common vertex set $V$ and let $d$ be a distance defined on every graph $G\in {\cal G}$. A set $S\subset V$ is said to be a simultaneous metric generator for ${\cal G}$ if for every $G\in {\cal…

Let $\Gamma$ denote a bipartite distance-regular graph with diameter $D \ge 4$ and valency $k \ge 3$. Let $X$ denote the vertex set of $\Gamma$, and let $A$ denote the adjacency matrix of $\Gamma$. For $x \in X$ let $T=T(x)$ denote the…

We introduce a general framework for analyzing data modeled as parameterized families of networks. Building on a Gromov-Wasserstein variant of optimal transport, we define a family of parameterized Gromov-Wasserstein distances for comparing…

We introduce the notion of a centroidal locating set of a graph $G$, that is, a set $L$ of vertices such that all vertices in $G$ are uniquely determined by their relative distances to the vertices of $L$. A centroidal locating set of $G$…

This paper deals with three resolving parameters: the metric dimension, the upper dimension and the resolving number. We first answer a question raised by Chartrand and Zhang asking for a characterization of the graphs with equal metric…