Related papers: Distance in the Ellipticity Graph

The study of the topological structure of complex networks has fascinated researchers for several decades, and today we have a fairly good understanding of the types and reoccurring characteristics of many different complex networks.…

Let $f$ and $g$ be two elliptic elements in $\mathbf{PU}(2,1)$ of order $m$ and $n$ respectively, where $m\geq n>2$. We prove that if the distance $\delta(f,g)$ between the complex lines or points fixed by $f$ and $g$ is large than a…

This article studies automorphism groups of graph products of arbitrary groups. We completely characterise automorphisms that preserve the set of conjugacy classes of vertex groups as those automorphisms that can be decomposed as a product…

A geometric graph is a combinatorial graph, endowed with a geometry that is inherited from its embedding in a Euclidean space. Formulation of a meaningful measure of (dis-)similarity in both the combinatorial and geometric structures of two…

Let $X$ be a non-empty set of positive integers and $X^*=X\setminus \{1\}$. The divisibility graph $D(X)$ has $X^*$ as the vertex set and there is an edge connecting $a$ and $b$ with $a, b\in X^*$ whenever $a$ divides $b$ or $b$ divides…

A distance graph is an undirected graph on the integers where two integers are adjacent if their difference is in a prescribed distance set. The independence ratio of a distance graph $G$ is the maximum density of an independent set in $G$.…

We define a (pseudo-)distance between graphs based on the spectrum of the normalized Laplacian, which is easy to compute or to estimate numerically. It can therefore serve as a rough classification of large empirical graphs into families…

Given a formation $\mathfrak F$, we consider the graph whose vertices are the elements of $G$ and where two vertices $g,h\in G$ are adjacent if and only if $\langle g,h \rangle \notin\mathfrak F$. We are interested in the two following…

In classical homotopy theory, two spaces are homotopy equivalent if one space can be continuously deformed into the other. This theory, however, does not respect the discrete nature of graphs. For this reason, a discrete homotopy theory…

In a paper from 2011, Jiang, Wang and Zhang studied the fixed points and fixed subgroups of selfmaps on a connected finite graph or a connected compact hyperbolic surface $X$. In particular, for any selfmap $f: X\to X$, they proved that a…

Let $E \subset {\Bbb F}_q^d$, the $d$-dimensional vector space over a finite field with $q$ elements. Construct a graph, called the distance graph of $E$, by letting the vertices be the elements of $E$ and connect a pair of vertices…

The Difference graph $\mathcal{D}(G)$ of a finite group $G$ is the difference of the enhanced power graph $\mathcal{P}_{E}(G)$ and the power graph $\mathcal{P}(G)$ with all the isolated vertices removed. In this paper, we characterize the…

We define analogues of the graphs of free splittings, of cyclic splittings, and of maximally-cyclic splittings of $F_N$ for free products of groups, and show their hyperbolicity. Given a countable group $G$ which splits as…

To each finite frame $\varphi$ in an inner product space $\mathcal{H}$ we associate a simple graph $G(\varphi)$, called {\it frame graph}, with the vectors of the frame as vertices and there is an edge between vertices $f$ and $g$ provided…

We study graph products of groups from the viewpoint of measured group theory. We first establish a full measure equivalence classification of graph products of countably infinite groups over finite simple graphs with no transvection and no…

We show that for various classes C of sparse graphs, and several measures of distance to such classes (such as edit distance and elimination distance), the problem of determining the distance of a given graph G to C is fixed-parameter…

Distance well-defined graphs consist of connected undirected graphs, strongly connected directed graphs and strongly connected mixed graphs. Let $G$ be a distance well-defined graph, and let ${\sf D}(G)$ be the distance matrix of $G$.…

A commonly studied means of parameterizing graph problems is the deletion distance from triviality (Guo et al. 2004), which counts vertices that need to be deleted from a graph to place it in some class for which efficient algorithms are…

In this paper, we present a new metric distance for comparing two large graphs to find similarities and differences between them based on one of the most important graph structural properties, which is Node Adjacency Information, for all…

Let $G$ be a group. The directed endomorphism graph, \dend of $G$ is a directed graph with vertex set $G$ and there is a directed edge from the vertex `$a$' to the vertex `$\, b$' $(a \neq b) $ if and only if there exists an endomorphism on…