相关论文: omega-Periodic graphs

Let $\alpha \in \mathbb{C}$ be an exponential period. We show that the real and imaginary part of $\alpha$ are up to signs volumes of sets definable in the o-minimal structure generated by $\mathbb{Q}$, the real exponential function and…

The $\gamma$-graph of a graph $G$ is the graph whose vertices are labelled by the minimum dominating sets of $G$, in which two vertices are adjacent when their corresponding minimum dominating sets (each of size $\gamma(G)$) intersect in a…

Periodic orbits (equivalence classes of closed paths up to cyclic shifts) play an important role in applications of graph theory. For example, they appear in the definition of the Ihara zeta function and exact trace formulae for the spectra…

We prove quantum ergodicity for a family of graphs that are obtained from ergodic one-dimensional maps of an interval using a procedure introduced by Pakonski et al (J. Phys. A, v. 34, 9303-9317 (2001)). As observables we take the L^2…

In this paper we study a class of dynamical systems generated by iterations of multivariate polynomials and estimate the degreegrowth of these iterations. We use these estimates to bound exponential sums along the orbits of these dynamical…

Temporal graphs are a class of graphs defined by a constant set of vertices and a changing set of edges, each of which is known as a timestep. These graphs are well motivated in modelling real-world networks, where connections may change…

The definition of edge-regularity in graphs is a relaxation of the definition of strong regularity, so strongly regular graphs are edge-regular and, not surprisingly, the family of edge-regular graphs is much larger and more diverse than…

We extend the concept of the law of a finite graph to graphings, which are, in general, infinite graphs whose vertices are equipped with the structure of a probability space. By doing this, we obtain a vast array of new unimodular measures.…

A \emph{three-dimensional grid drawing} of a graph is a placement of the vertices at distinct points with integer coordinates, such that the straight line segments representing the edges do not cross. Our aim is to produce three-dimensional…

Graphs, and sequences of growing graphs, can be used to specify the architecture of mathematical models in many fields including machine learning and computational science. Here we define structured graph "lineages" (ordered by level…

We compute the depth and (give bounds for) the regularity of generalized binomial edge ideals associated with generalized block graphs.

Every automaton group naturally acts on the space $X^\omega$ of infinite sequences over some alphabet $X$. For every $w\in X^\omega$ we consider the Schreier graph $\Gamma_w$ of the action of the group on the orbit of $w$. We prove that for…

Each graph and choice of a commutative ring gives rise to an associated graphical group. In this article, we introduce and investigate graph polynomials that enumerate conjugacy classes of graphical groups over finite fields according to…

This work introduces the concept of \emph{upper-critical graphs}, in a complementary way of the conventional (lower)critical graphs: an element $x$ of a graph $G$ is called \emph{critical} if $\chi(G-x)<\chi(G)$. It is said that $G$ is a…

We present exact, explicit, convergent periodic-orbit expansions for individual energy levels of regular quantum graphs. One simple application is the energy levels of a particle in a piecewise constant potential. Since the classical ray…

Edge lengths of a graph are called flexible if there exist infinitely many non-congruent realizations of the graph in the plane satisfying these edge lengths. It has been shown recently that a graph has flexible edge lengths if and only if…

In this paper we investigate families of connected graphs which do not contain an odd cycle in their complement. Specifically, we consider graphs formed by two complete graphs connected in a particular way. We determine which of these…

We study countable graphs that -- up to isomorphism and with probability one -- arise from a random process, in a similar fashion as the Rado graph. Unlike in the classical case, we do not require that probabilities assigned to pairs of…

We interpret realizations of a graph on the sphere up to rotations as elements of a moduli space of curves of genus zero. We focus on those graphs that admit an assignment of edge lengths on the sphere resulting in a flexible object. Our…

Diophantine tuples are of ancient and modern interest, with a huge literature. In this paper we study Diophantine graphs, i.e., finite graphs whose vertices are distinct positive integers, and two vertices are linked by an edge if and only…