Related papers: Graph covers and ergodicity for 0-dimensional syst…
A Bratteli diagram is a type of graph in which the vertices are split into finite subsets occupying an infinite sequence of levels, starting with a bottom level and moving to successively higher levels along edges connecting consecutive…
Tanigawa (2016) showed that vertex-redundant rigidity of a graph implies its global rigidity in arbitrary dimension. We extend this result to periodic graphs under fixed lattice representations. A periodic graph is vertex-redundantly rigid…
We show that finding orthogonal grid-embeddings of plane graphs (planar with fixed combinatorial embedding) with the minimum number of bends in the so-called Kandinsky model (which allows vertices of degree $> 4$) is NP-complete, thus…
Ergodic exploration has spawned a lot of interest in mobile robotics due to its ability to design time trajectories that match desired spatial coverage statistics. However, current ergodic approaches are for continuous spaces, which require…
In this paper, we study sequences of perfect t-embeddings of a uniformly weighted family of graphs we call generalized tower graphs. We show that the embeddings of these graphs satisfy certain technical assumptions, in particular, the…
We reduce the problem of proving deterministic and nondeterministic Boolean circuit size lower bounds to the analysis of certain two-dimensional combinatorial cover problems. This is obtained by combining results of Razborov (1989),…
Let $G=(V,E)$ be a finite, connected graph. We consider a greedy selection of vertices: given a list of vertices $x_1, \dots, x_k$, take $x_{k+1}$ to be any vertex maximizing the sum of distances to the existing vertices and iterate: we…
A vertex-girth-regular $vgr(v,k,g,\lambda)$-graph is a $k$-regular graph of girth $g$ and order $v$ in which every vertex belongs to exactly $\lambda$ cycles of length $g$. While all vertex-transitive graphs are necessarily…
Given a Bratteli diagram B, we study the set O(B) of all possible orderings w on a Bratteli diagram B and its subset P(B) consisting of `perfect' orderings that produce Bratteli-Vershik dynamical systems (Vershik maps). We give necessary…
This is a companion paper to the paper "Hyperstability in the Erdos-Sos Conjecture". In that paper the following rough structure theorem was proved for graphs G containing no copy of a bounded degree tree T: from any such G, one can delete…
Vertex connectivity and edge connectivity are fundamental concepts in graph theory that have been widely studied from both structural and algorithmic perspectives. The focus of this paper is on computing these two parameters for graphs…
We give an estimate of the quantum variance for $d$-regular graphs quantised with boundary scattering matrices that prohibit back-scattering. For families of graphs that are expanders, with few short cycles, our estimate leads to quantum…
A graph is said to be globally rigid if almost all embeddings of the graph's vertices in the Euclidean plane will define a system of edge-length equations with a unique (up to isometry) solution. In 2007, Jackson, Servatius and Servatius…
The electron-transport properties of adatom-graphene system are investigated for different (random, correlated, and ordered) spatial configurations of adatoms over different types of high symmetry sites with various adsorption heights. K…
We show how arbitrary unit cells of periodic materials can be represented as graphs whose nodes represent atoms and whose weighted edges represent tunneling connections between atoms. Further, we present methods to calculate the band…
A planar orthogonal drawing of a planar 4-graph G (i.e., a planar graph with vertex-degree at most four) is a crossing-free drawing that maps each vertex of G to a distinct point of the plane and each edge of $G$ to a sequence of horizontal…
We generalize the notion of an inverse sequence of graph covers from the zero-dimensional dynamical systems to any dynamical system.
For an integer $k\ge 3$, a $k$-path vertex cover of a graph $G=(V,E)$ is a set $T\subseteq V$ that shares a vertex with every path subgraph of order $k$ in $G$. The minimum cardinality of a $k$-path vertex cover is denoted by $\psi_k(G)$.…
The minimal vertex-cover (or maximal independent-set) problem is studied on random graphs of finite connectivity. Analytical results are obtained by a mapping to a lattice gas of hard spheres of (chemical) radius one, and they are found to…
We introduce two parametrized families of piecewise affine maps on $[0,1]^2$ and $[0,1]^3$, as generalizations of the heterochaos baker maps which were introduced and investigated in [Y. Saiki, H. Takahasi, J. A. Yorke, Nonlinearity, 34…