Related papers: Using a Grassmann graph to recover the underlying …

We introduce a Fefferman-type construction that associates an almost Grassmannian structure of type $(2,n+1)$ to every $(n+1)$-dimensional path geometry. We prove that the construction is normal and provide two equivalent characterizing…

A new class of distances for graph vertices is proposed. This class contains parametric families of distances which reduce to the shortest-path, weighted shortest-path, and the resistance distances at the limiting values of the family…

Let $q=p^e$, where $p$ is a prime and $e\geq 1$ is an integer. For $m\geq 1$, let $P$ and $L$ be two copies of the $(m+1)$-dimensional vector spaces over the finite field $\mathbb{F}_q$. Consider the bipartite graph $W_m(q)$ with partite…

Let $[n]^{(k)}$ be the set of all ordered $k$-tuples of distinct elements in $[n]=\{1,2,...,n\}$. The $(n,k,r)$-arrangement graph $A(n,k,r)$ with $1\leq r\leq k\leq n$, is the graph with vertex set $[n]^{(k)}$ and with two $k$-tuples are…

We propose a new graph metric and study its properties. In contrast to the standard distance in connected graphs, it takes into account all paths between vertices. Formally, it is defined as d(i,j)=q_{ii}+q_{jj}-q_{ij}-q_{ji}, where q_{ij}…

On the Grassmann manifold G (m, n) of m-dimensional subspaces of an n-dimensional projective space P^n, a certain supplementary construction called the normalization is considered. By means of this normalization, one can construct the…

In this paper we systematically study various properties of the distance graph in ${\Bbb F}_q^d$, the $d$-dimensional vector space over the finite field ${\Bbb F}_q$ with $q$ elements. In the process we compute the diameter of distance…

Weighted Padovan graphs $\Phi^{n}_{k}$, $n \geq 1$, $\lfloor \frac{n}{2} \rfloor \leq k \leq \lfloor \frac{2n-2}{3} \rfloor$, are introduced as the graphs whose vertices are all Padovan words of length $n$ with $k$ $1$s, two vertices being…

In this paper we study the geometry of graph spaces endowed with a special class of graph edit distances. The focus is on geometrical results useful for statistical pattern recognition. The main result is the Graph Representation Theorem.…

In this paper, we consider the graph alignment problem, which is the problem of recovering, given two graphs, a one-to-one mapping between nodes that maximizes edge overlap. This problem can be viewed as a noisy version of the well-known…

Learning efficient graph representation is the key to favorably addressing downstream tasks on graphs, such as node or graph property prediction. Given the non-Euclidean structural property of graphs, preserving the original graph data's…

We study the problem of detecting the presence of an underlying high-dimensional geometric structure in a random graph. Under the null hypothesis, the observed graph is a realization of an Erd\H{o}s-R\'enyi random graph $G(n,p)$. Under the…

The generalized Petersen graph $G(n, k)$ is a cubic graph with vertex set $V(G(n, k)) = \{v_i\}_{0 \leq i < n} \cup \{w_i\}_{0 \leq i < n}$ and edge set $E(G(n, k)) = \{v_i v_{i+1}\}_{0 \leq i < n} \cup \{w_i w_{i+k}\}_{0 \leq i < n} \cup…

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 Terwilliger algebra $T(x)$ of a finite connected simple graph $\Gamma$ with respect to a vertex $x$ is the complex semisimple matrix algebra generated by the adjacency matrix $A$ of $\Gamma$ and the diagonal matrices…

For any non-negative integers $v > k > i$, the {\em generalized Johnson graph}, $J(v,k,i)$, is the undirected simple graph whose vertices are the $k$-subsets of a $v$-set, and where any two vertices $A$ and $B$ are adjacent whenever $|A…

Let F* be the finite field of q elements and let P(n,q) be the projective space of dimension n-1 over F*. We construct a family H^{n}_{k,i} of combinatorial homology modules associated to P(n,q) over a coefficient field F field of…

Using connections to random matrix theory and orthogonal polynomials, we develop a framework for obtaining explicit closed-form formulae for the number, $\mathscr{N}_{g}(2\nu,j)$, of connected $2\nu$-valent labeled graphs with $j$ vertices…

A connected graph $G$ of diameter ${\rm diam}(G) \ge \ell$ is $\ell$-distance-balanced if $|W_{xy}|=|W_{yx}|$ for every $x,y\in V(G)$ with $d_{G}(x,y)=\ell$, where $W_{xy}$ is the set of vertices of $G$ that are closer to $x$ than to $y$.…

For any positive definite rational quadratic form $q$ of $n$ variables let $G(\mathbb{Q}^n, q)$ denote the graph with vertices $\mathbb{Q}^n$ and $x, y \in \mathbb{Q}^n$ connected iff $q(x - y) = 1$. This notion generalises standard…