相关论文: Symmetry properties of generalized graph truncatio…

In this paper we consider tiling $\{p, q \}$ of the Euclidean space and of the hyperbolic space, and its dual graph $\Gamma_{q, p}$ from a combinatorial point of view. A substitution $\sigma_{q, p}$ on an appropriate finite alphabet is…

We demonstrate a construction method based on a gain function that is defined on the incidence graph of an incidence geometry. Restricting to when the incidence geometry is a linear space, we show that the construction yields a generalized…

A $d$-dimensional bar-and-joint framework $(G,p)$ with underlying graph $G$ is called universally rigid if all realizations of $G$ with the same edge lengths, in all dimensions, are congruent to $(G,p)$. A graph $G$ is said to be…

We introduce a general class of algorithms and supply a number of general results useful for analysing these algorithms when applied to regular graphs of large girth. As a result, we can transfer a number of results proved for random…

We classify Cohen-Macaulay graphs of girth at least $5$ and planar Gorenstein graphs of girth at least $4$. Moreover, such graphs are also vertex decomposable.

We give a general construction leading to different non-isomorphic families $\Gamma_{n,q}(\K)$ of connected $q$-regular semisymmetric graphs of order $2q^{n+1}$ embedded in $\PG(n+1,q)$, for a prime power $q=p^h$, using the linear…

For undirected graphs, the Ricci curvature introduced by Lin-Lu-Yau has been widely studied from various perspectives, especially geometric analysis. In the present paper, we discuss generalization problem of their Ricci curvature for…

A set of vertices of a graph is distinguishing if the only automorphism that preserves it is the identity. The minimal size of such sets, if they exist, is the distinguishing cost. The distinguishing costs of vertex transitive cubic graphs…

We introduce linear Dirac and generalized complex structures on Cartan geometries and give criteria for Dirac subalgebras of $\frkg\ltimes\frkg^*$ representing Dirac structures on a Cartan geometry. We prove that there is a bijection…

We explore the consequence of generalized symmetries in four-dimensional $\mathcal{N}=1$ superconformal field theories. First, we classify all possible supersymmetric gauge theories with a simple gauge group that have a nontrivial one-form…

Many real-world networks of interest are embedded in physical space. We present a new random graph model aiming to reflect the interplay between the geometries of the graph and of the underlying space. The model favors configurations with…

The unit ball random geometric graph $G=G^d_p(\lambda,n)$ has as its vertices $n$ points distributed independently and uniformly in the $d$-dimensional unit ball, with two vertices adjacent if and only if their $l_p$-distance is at most…

A realization of a graph $G=(V,E)$ is a map $v\colon V\to\Bbb R^d$ that assigns to each vertex a point in $d$-dimensional Euclidean space. We study graph realizations from the perspective of representation theory (expressing certain…

Quantum field theories can exhibit various generalized symmetry structures, among which higher-group symmetries and non-invertible symmetry defects are particularly prominent. In this work, we explore a new general scenario in which these…

We present a novel construction of finite groupoids whose Cayley graphs have large girth even w.r.t. a discounted distance measure that contracts arbitrarily long sequences of edges from the same colour class (sub-groupoid), and only counts…

An automorphism of a graph is called quasi-semiregular if it fixes a unique vertex of the graph and its remaining cycles have the same length. This kind of symmetry of graphs was first investigated by Kutnar, Malni\v{c}, Mart\'{i}nez and…

Let $G$ be a finite group and $N$ a normal subgroup of $G$. We determine the structure of $N$ when the graph $\Gamma_G(N)$, which is the graph associated to the conjugacy classes of $G$ contained in $N$, has no triangles and when the graph…

A rigidity theory is developed for the Euclidean and non-Euclidean placements of countably infinite simple graphs in R^d with respect to the classical l^p norms, for d>1 and 1<p<\infty. Generalisations are obtained for the Laman and…

Every embedded surface $\mathcal{K}$ in the 4-sphere admits a bridge trisection, a decomposition of $(S^4,\mathcal{K})$ into three simple pieces. In this case, the surface $\mathcal{K}$ is determined by an embedded 1-complex, called the…

Given a graph $G$, we define ${\bf bcg}(G)$ as the minimum $k$ for which $G$ can be contracted to the uniformly triangulated grid $\Gamma_{k}$. A graph class ${\cal G}$ has the SQG${\bf C}$ property if every graph $G\in{\cal G}$ has…