Related papers: Quasi-isometries between graphs with variable edge…

The main purpose of the present paper is to define and study the notion of quasi bi-slant submanifolds of almost contact metric manifolds. We mainly concerned with quasi bi-slant submanifolds of cosymplectic manifolds as a generalization of…

Many applications in pattern recognition represent patterns as a geometric graph. The geometric graph distance (GGD) has recently been studied as a meaningful measure of similarity between two geometric graphs. Since computing the GGD is…

Quasiconformal maps in the plane are orientation preserving homeomorphisms that satisfy certain distortion inequalities; infinitesimally, they map circles to ellipses of bounded eccentricity. Such maps have many useful geometric distortion…

Let $\Gamma=\Gamma(A)$ denote a simple strongly connected digraph with vertex set $X$, diameter $D$, and let $\{A_0,A:=A_1,A_2,\ldots,A_D\}$ denote the set of distance-$i$ matrices of $\Gamma$. Let $\{R_i\}_{i=0}^D$ denote a partition of…

In this paper, we introduce the notion of Reidemeister torsion for quasi-isomorphisms of based chain complexes over a field. We call a chain map a quasi-isomorphism if its induced homomorphism between homology is an isomorphism. Our notion…

A graph is $k$-planar $(k \geq 1)$ if it can be drawn in the plane such that no edge is crossed more than $k$ times. A graph is $k$-quasi planar $(k \geq 2)$ if it can be drawn in the plane with no $k$ pairwise crossing edges. The families…

We introduce a class of mappings called vertical quasi-isometries and show that branched quasisymmetries $X\to Y$ of Guo and Williams between compact, bounded turning metric doubling spaces admit natural vertically quasi-isometric…

Symmetry is an important aesthetic criteria in graph drawing and network visualisation. Symmetric graph drawings aim to faithfully represent automorphisms of graphs as geometric symmetries in a drawing. In this paper, we design and…

Distance-regular graphs are a class of regualr graphs with pretty combinatorial symmetry. In 2007, Miklavi\v{c} and Poto\v{c}nik proposed the problem of charaterizing distance-regular Cayley graphs, which can be viewed as a natural…

For a 3-manifold M and a subsurface $X$ of the boundary of M with empty or incompressible boundary we use surgery to identify a graph whose vertices are disks with boundary in X and which is quasi-isometrically embedded in the curve graph…

Beyond-planarity focuses on the study of geometric and topological graphs that are in some sense nearly-planar. Here, planarity is relaxed by allowing edge crossings, but only with respect to some local forbidden crossing configurations.…

We study the properties of several proximity measures for the vertices of weighted multigraphs and multidigraphs. Unlike the classical distance for the vertices of connected graphs, these proximity measures are applicable to weighted…

Spaces of quasi-invariant measures supplied with different topologies are studied. Their embeddings, projective decompositions, conditions for their metrizability are investigated. Theorems about convergence of nets of quasi-invariant…

Graph spanners are sparse subgraphs which approximately preserve all pairwise shortest-path distances in an input graph. The notion of approximation can be additive, multiplicative, or both, and many variants of this problem have been…

A graph G is {\xi}-nearly planar if it can be embedded in the sphere so that each of its edges is crossed at most {\xi} times. The family of {\xi}-nearly planar graphs is widely extending the notion of planarity. We introduce an alternative…

We investigate isoperimetric constants of infinite tessellating metric graphs. We introduce a curvature-like quantity, which plays the role of a metric graph analogue of discrete curvature notions for combinatorial tessellating graphs. We…

We study the geometry of the Thurston metric on Teichmuller space by examining its geodesics and comparing them to Teichmuller geodesics. We show that, similar to a Teichmuller geodesic, the shadow of a Thurston geodesic to the curve graph…

Let $G$ denote a $Q$-polynomial distance-regular graph with diameter $D$ at least 4. Assume that the intersection numbers of $G$ satisfy $a_i=0$ for $0 \leq i \leq D-1$ and $a_D\neq 0$. We show that $G$ is a polygon, a folded cube, or an…

With the advancement of computer technology, there is a surge of interest in effective mapping methods for objects in higher-dimensional spaces. To establish a one-to-one correspondence between objects, higher-dimensional quasi-conformal…

We analyze the nonlinear optics of quasi one-dimensional quantum graphs and manipulate their topology and geometry to generate for the first time nonlinearities in a simple system approaching the fundamental limits of the first and second…