相关论文: Dot-product graphs in finite fields

In this paper we enumerate the necessary and sufficient conditions for the weak modular product of two simple graphs to be perfect. The weak modular product differs from the direct product by also encoding non-adjacencies of the factor…

We study the automorphisms of a graph product of finitely-generated abelian groups W. More precisely, we study a natural subgroup Aut* W of Aut W, with Aut* W = Aut W whenever vertex groups are finite and in a number of other cases. We…

We show that if $E \subset \mathbb{F}_q^d$, the $d$-dimensional vector space over the finite field with $q$ elements, and $|E| \geq \rho q^d$, where $ q^{-\frac{1}{2}}\ll \rho \leq 1$, then $E$ contains an isometric copy of at least $c…

For a large class of self-similar sets F in R^d analogues of the higher order mean curvatures of differentiable submanifolds are introduced, in particular, the fractal Gauss-type curvature. They are shown to be the densities of associated…

Mapping class groups of locally finite graphs are the analogue of those of infinite-type surfaces, and serve as a "big" version of $\text{Out}(F_n)$. In this paper, we investigate which of these mapping class groups have a dense conjugacy…

Latent-position random graph models usually treat the node set as fixed once the sample size is chosen, while graphon-based and random-measure constructions allow more randomness at the cost of weaker geometric interpretability. We…

Given a graph $G$, the exact distance-$p$ graph $G^{[\natural p]}$ has $V(G)$ as its vertex set, and two vertices are adjacent whenever the distance between them in $G$ equals $p$. We present formulas describing the structure of exact…

Let $\mathbb{F}_p$ be a finite field of prime order $p$ and let $A \subset \mathbb{F}_p$ be a subset. In the dense regime when $|A| \geq \alpha p$ for some $\alpha \in (0,1)$, we determine the optimal constant $f(\alpha)$ in the inequality…

The direct product of graphs $G_1,\ldots,G_n$ is the graph with vertex set $V(G_1)\times\cdots\times V(G_n)$ in which two vertices $(g_1,\ldots,g_n)$ and $(g_1',\ldots,g_n')$ are adjacent if and only if $g_i$ is adjacent to $g_i'$ in $G_i$…

This paper is concerned with the recognition of approximate graph products with respect to the Cartesian product. Most graphs are prime, although they can have a rich product-like structure. The proposed algorithms are based on a local…

We show that the curvature K_(G*H)(x,y) at a point (x,y) in the strong product G*H of two arbitrary finite simple graphs is equal to the product K_G(x) K_H(y) of the curvatures.

In this paper, we introduce a flip operation on self-complementary ideals of chain product posets and study the resulting flip graphs. We give asymptotics for the number of vertices in these graphs, compute their diameters, and give bounds…

A Norton algebra is an eigenspace of a distance regular graph endowed with a commutative nonassociative product called the Norton product, which is defined as the projection of the entrywise product onto this eigenspace. The Norton algebras…

We introduce the combinatorial notion of a $q$-fatorization graph intended as a tool to study and express results related to the classification of prime simple modules for quantum affine algebras. These are directed graphs equipped with…

We prove a quantitative, finitary version of Trofimov's result that a connected, locally finite vertex-transitive graph G of polynomial growth admits a quotient with finite fibres on which the action of Aut(G) is virtually nilpotent with…

In this paper, we introduce a new concept namely degree polynomial for vertices of a simple graph. This notion leads to a concept namely degree polynomial sequence which is stronger than the concept of degree sequence. After obtaining the…

We study the undirected divisibility graph in which the vertex set is a finite subset of consecutive natural numbers up to N.We derive analytical expressions for measures of the graph like degree, clustering, geodesic distance and…

Let $f(t_1,\ldots,t_n)$ be a nondegenerate integral quadratic form. We analyze the asymptotic behavior of the function $D_f(X)$, the number of integers of absolute value up to $X$ represented by $f$. When $f$ is isotropic or $n$ is at least…

P. Erd\H{o}s [On extremal problems of graphs and generalized graphs, Israel Journal of Mathematics 2 (1964), 183-190] characterised those hypergraphs $F$ that have to appear in any sufficiently large hypergraph $H$ of positive density. We…

Let $d\ge3$ and $\mathbb{F}_q^{\,d}$ be the $d$-dimensional vector space over a finite field of order $q$, where $q$ is an odd prime power. Let $X_\pi$ be the set of lines through the origin intersecting the slice $\pi\cap S^{d-1}$, where…