Related papers: Zigzags in combinatorial tetrahedral chains and th…
Ribbons of two-dimensional lattices have properties depending sensitively on the morphology of the two edges. For regular ribbons with two parallel straight edges, the atomic chains terminating the two edges may have more than one choices…
It is shown that there are examples of distinct polyhedra, each with a Hamiltonian path of edges, which when cut, unfolds the surfaces to a common net. In particular, it is established for infinite classes of triples of tetrahedra.
We define an inhomogeneous percolation model on "ladder graphs" obtained as direct products of an arbitrary graph $G = (V,E)$ and the set of integers $\mathbb{Z}$ (vertices are thought of as having a "vertical" component indexed by an…
A biased graph is a graph with a class of selected circles ("cycles", "circuits"), called balanced, such that no theta subgraph contains exactly two balanced circles. A biased graph $\Omega$ has two natural matroids, the frame matroid…
We propose a Markov chain simulation method to generate simple connected random graphs with a specified degree sequence and level of clustering. The networks generated by our algorithm are random in all other respects and can thus serve as…
Consider the d-dimensional lattice Z^d where each vertex is ``open'' or ``closed'' with probability p or 1-p, respectively. An open vertex v is connected by an edge to the closest open vertex w such that the dth co-ordinates of v and w…
Many applications in network analysis require algorithms to sample uniformly at random from the set of all graphs with a prescribed degree sequence. We present a Markov chain based approach which converges to the uniform distribution of all…
The rotor walk is a derandomized version of the random walk on a graph. On successive visits to any given vertex, the walker is routed to each of the neighboring vertices in some fixed cyclic order, rather than to a random sequence of…
A mixed regular graph is a graph where every vertex has $z$ incoming arcs, $z$ outgoing arcs, and $r$ edges; furthermore, if it has girth $g$, we say that the graph is a \emph{$[z,r;g]$-mixed graph}. A \emph{$[z,r;g]$-mixed cage} is a…
Skeletal polyhedra and polygonal complexes in ordinary Euclidean 3-space are finite or infinite 3-periodic structures with interesting geometric, combinatorial, and algebraic properties. They can be viewed as finite or infinite 3-periodic…
The switch Markov chain has been extensively studied as the most natural Markov Chain Monte Carlo approach for sampling graphs with prescribed degree sequences. We use comparison arguments with other, less natural but simpler to analyze,…
A hole in a graph is an induced subgraph which is a cycle of length at least four. We prove that for every positive integer k, every triangle-free graph with sufficiently large chromatic number contains holes of k consecutive lengths.
The switch chain is a well-known Markov chain for sampling directed graphs with a given degree sequence. While not ergodic in general, we show that it is ergodic for regular degree sequences. We then prove that the switch chain is rapidly…
The Cycle double cover (CDC) conjecture states that for every bridgeless graph $G$, there exists a family $\mathcal{F}$ of cycles such that each edge of the graph is contained in exactly two members of $\mathcal{F}$. Given an embedding of a…
It is well-known that every 3-connected planar graph has a unique planar embedding on the sphere. We study the extension to triangulated 1-planar graphs, T1P graphs for short, which admit an embedding in which each edge is crossed at most…
In this paper, we study the connectivity of a one-dimensional soft random geometric graph (RGG). The graph is generated by placing points at random on a bounded line segment and connecting pairs of points with a probability that depends on…
Graphene-based nanostructures exhibit a vast range of exciting electronic properties that are absent in extended graphene. For example, quantum confinement in carbon nanotubes and armchair graphene nanoribbons (AGNRs) leads to the opening…
Many complex systems exhibit interactions that depend not only on pairwise connections, but also group structures and memory effects. To capture such effects, we develop a unified tensor framework for modeling higher-order Markov chains…
The asymmetric tetrahedron is composed by all edges of tetrahedron represented by Ising interaction except one, which has a Heisenberg type interaction. This asymmetric tetrahedron is arranged connecting a vertex which edges are only Ising…
A contraction sequence of a graph consists of iteratively merging two of its vertices until only one vertex remains. The recently introduced twin-width graph invariant is based on contraction sequences. More precisely, if one puts red edges…