Related papers: Quasi-isometries between graphs with variable edge…
We study the concept of the continuous mean distance of a weighted graph. For connected unweighted graphs, the mean distance can be defined as the arithmetic mean of the distances between all pairs of vertices. This parameter provides a…
We present a variation of quasi-isometry to approach the problem of defining a geometric notion equivalent to commensurability. In short, this variation can be summarized as "quasi-isometry with uniform parameters for a large enough family…
In \cite{Oh22}, the second author defined a complex of groups decomposition of the fundamental group of a finitely generated 2-dimensional special group, called an \emph{intersection complex}, which is a quasi-isometry invariant. In this…
Quasi-median graphs are a tool commonly used by evolutionary biologists to visualise the evolution of molecular sequences. As with any graph, a quasi-median graph can contain cut vertices, that is, vertices whose removal disconnect the…
In a graph $A$, the measure $|M_g^A(f)|=m_g^A(f)$ for each arbitrary edge $f=gh$ counts the edges in $A$ closer to $g$ than $h$. $A$ is termed an edge quasi-$\lambda$-distance-balanced graph in a metric space (abbreviated as $EQDBG$), where…
We prove that a PQ-symmetric homeomorphism between two complete metric spaces can be extended to a quasi-isometry between their hyperbolic approximations. This result is used to prove that two visual Gromov hyperbolic spaces are…
We study geometric and topological properties of infinite graphs that are quasi-isometric to a planar graph of bounded degree. We prove that every locally finite quasi-transitive graph excluding a minor is quasi-isometric to a planar graph…
A mixed graph can be seen as a type of digraph containing some edges (two opposite arcs). Here we introduce the concept of sequence mixed graphs, which is a generalization of both sequence graphs and iterated line digraphs. These structures…
A quasi-isometry between two connected graphs is measure-scaling if one can control precisely the sizes of pre-images of finite subsets. Such a notion is motivated by the work of Eskin-Fisher-Whyte on lamplighters over $\mathbb{Z}$ and the…
Quasi-random graphs can be informally described as graphs whose edge distribution closely resembles that of a truly random graph of the same edge density. Recently, Shapira and Yuster proved the following result on quasi-randomness of…
Gray and Kambites introduced a notion of hyperbolicity in the setting of semimetric spaces like digraphs or semigroups. We will prove that under a small additional geometric assumption their notion of hyperbolicity is preserved by…
It is shown that every 2-planar graph is quasiplanar, that is, if a simple graph admits a drawing in the plane such that every edge is crossed at most twice, then it also admits a drawing in which no three edges pairwise cross. We further…
The concept of pseudo-distance-regularity around a vertex of a graph is a natural generalization, for non-regular graphs, of the standard distance-regularity around a vertex. In this note, we prove that a pseudo-distance-regular graph…
In this paper we show that certain almost distance-regular graphs, the so-called $h$-punctually walk-regular graphs, can be characterized through the cospectrality of their perturbed graphs. A graph $G$ with diameter $D$ is called…
We introduce a generalization of the b-metric we call a (b,c)-metric. We show that if $X$ is a $(b,c)$-metric space and $\psi: X \longrightarrow Y$ is a quasi-isometry then $Y$ is $(b,c)$-metrizable. We also define a particular kind of…
We study permanence results for almost quasi-isometries, the maps arising from the Gromov construction of finitely generated random groups that contain expanders (and hence that are not C*-exact). We show that the image of a sequence of…
This is the first of two papers which aim to understand quasi-isometries of a subclass of unimodular split solvable Lie groups. In the present paper, we show that locally (in a coarse sense), a quasi-isometry between two groups in this…
In this paper, we propose a new type of graph, denoted as "embedded-graph", and its theory, which employs a distributed representation to describe the relations on the graph edges. Embedded-graphs can express linguistic and complicated…
We show that the fundamental groups of any two closed irreducible non-geometric graph-manifolds are quasi-isometric. This answers a question of Kapovich and Leeb. We also classify the quasi-isometry types of fundamental groups of…
The editing of a combinatorial object is the alteration of some of its elements such that the resulting object satisfies a certain fixed property. The edit problem for graphs, when the edges are added or deleted, was first studied…