Related papers: Periodic 2-graphs arising from subshifts
Non-commutative multivariable versions of weighted shift operators arise naturally as `weighted' left creation operators acting on the Fock space Hilbert space. We identify a natural notion of periodicity for these $N$-tuples, and then find…
We give a new characterization of the peak subalgebra of the algebra of quasisymmetric functions and use this to construct a new basis for this subalgebra. As an application of these results we obtain a combinatorial formula for the…
Graph product structure theory expresses certain graphs as subgraphs of the strong product of much simpler graphs. In particular, an elegant formulation for the corresponding structural theorems involves the strong product of a path and of…
We develop random graph models where graphs are generated by connecting not only pairs of vertices by edges but also larger subsets of vertices by copies of small atomic subgraphs of arbitrary topology. This allows the for the generation of…
In 1930, Ramsey proved that every large graph contains either a large clique or a large edgeless graph as an induced subgraph. It is well known that every large connected graph contains a long path, a large clique, or a large star as an…
The paper proves two theorems concerning the set of periods of periodic orbits for maps of graphs that are homotopic to the constant map and such that the vertices form a periodic orbit. The first result is that if $v$ is not a divisor of…
We describe a new family of triply-periodic minimal surfaces with hexagonal symmetry, related to the quartz (qtz) and its dual (the qzd net). We provide a solution to the period problem and provide a parametrisation of these surfaces, that…
We present an order-theoretic approach to the study of countably infinite locally 2-arc-transitive bipartite graphs. Our approach is motivated by techniques developed by Warren and others during the study of cycle-free partial orders. We…
We propose a new family of combinatorial inference problems for graphical models. Unlike classical statistical inference where the main interest is point estimation or parameter testing, combinatorial inference aims at testing the global…
We introduce a new notation for representing labeled regular bipartite graphs of arbitrary degree. Several enumeration problems for labeled and unlabeled regular bipartite graphs have been introduced. A general algorithm for enumerating all…
The age $\mathcal{A}(G)$ of a graph $G$ (undirected and without loops) is the collection of finite induced subgraphs of $G$, considered up to isomorphy and ordered by embeddability. It is well-quasi-ordered (wqo) for this order if it…
Graphs derived from groups are a widely studied class of graphs, motivated by their highly symmetric structure. In particular, G-graphs offer an easy and interesting alternative construction of semi-symmetric graphs. After recalling the…
We define and investigate a new three-parameter family of graphs that further generalizes the Fibonacci and metallic cubes. Namely, the number of vertices in this family of graphs satisfies Horadam recurrence, a linear recurrence of second…
Define the middle layer graph as the graph whose vertex set consists of all bitstrings of length $2n+1$ that have exactly $n$ or $n+1$ entries equal to 1, with an edge between any two vertices for which the corresponding bitstrings differ…
Given a row-finite, source-free, graph of rank k, we extend the definition of reduction introduced by Eckhardt et al. This constitutes a large step forward in the extension of the geometric classification of finite directed graph…
Recent investigations in computational biology have focused on a family of 2-colored digraphs, called 2-colored best match graphs, which naturally arise from rooted phylogenetic trees. Actually the defining properties of such graphs are…
We introduce regular closed subgraphs of Katsura's topological graphs and use them to generalize the notion of an adjunction space from topology. Our construction attaches a topological graph onto another via a regular factor map. We prove…
These notes concern aspects of various graphs whose vertex set is a group $G$ and whose edges reflect group structure in some way (so that they are invariant under the action of the automorphism group of $G$). The graphs I will discuss are…
We consider the extremal family of graphs of order $2^n$ in which no two vertices have identical neighbourhoods, yet the adjacency matrix has rank only $n$ over the field of two elements. A previous result from algebraic geometry shows that…
In this paper, we extend the recently introduced concept of partially dual ribbon graphs to graphs. We then go on to characterize partial duality of graphs in terms of bijections between edge sets of corresponding graphs. This result…