Related papers: Honeycomb arrays
In this article we determine five previously unknown covering array numbers (CANs). We do so using properties of so called balanced covering arrays together with a computational result for these. The balance properties allow us to…
We define the_hive ring_, which has a basis indexed by dominant weights for GL(n), and structure constants given by counting hives [KT1] (or equivalently honeycombs, or Berenstein-Zelevinsky patterns [BZ1]). We use the octahedron rule from…
Honeycomb toroidal graphs are trivalent Cayley graphs on generalized dihedral groups. We examine the two historical threads leading to these graphs, some of the properties that have been established, and some open problems.
Except for Koshy who devotes seven pages to applications of Fibonacci Numbers to electric circuits, most books and the Fibonacci Quarterly have been relatively silent on applications of graphs and electric circuits to Fibonacci numbers.…
Let $\mathcal{H}$ be a $k$-uniform hypergraph. A chain in $\mathcal{H}$ is a sequence of its vertices such that every $k$ consecutive vertices form an edge. In 1999 Katona and Kierstead suggested to use chains in hypergraphs as the…
A graph is called homogeneously traceable if every vertex is an endpoint of a Hamilton path. In 1979 Chartrand, Gould and Kapoor proved that for every integer $n\ge 9,$ there exists a homogeneously traceable nonhamiltonian graph of order…
Orthogonal array, a classical and effective tool for collecting data, has been flourished with its applications in modern computer experiments and engineering statistics. Driven by the wide use of computer experiments with both qualitative…
In this article we apply an L-system to prove a recurrence formula for the length of the boundary of iterands of the well known Harter-Heighway dragon curve, a space filling curve with fractal boundary. This leads to finding formulas for…
Let $\ell \geq 2$ be an integer. For each $\eps >0$ remove from $\R^2$ the union of discs of radius $\eps$ centered at the integer lattice points $(m,n$, with $m\nequiv n\mod{\ell}$. Consider a point-like particle moving linearly at unit…
In this paper we determine all singular endomorphisms of the Hamming graph and other related graphs. The Hamming graph has vertices $\mathbb{Z}^{m}_n$ where two vertices are adjacent, if their Hamming distance is $1$. We show that its…
Motivated by recent experiments, we consider a generic spin model in the $j_{\text{eff}}=1/2$ basis for the hyperhoneycomb and harmonic-honeycomb iridates. Based on microscopic considerations, the effect of an additional bond-dependent…
A platypus graph is a non-hamiltonian graph for which every vertex-deleted subgraph is traceable. They are closely related to families of graphs satisfying interesting conditions regarding longest paths and longest cycles, for instance…
Given a graph on $n$ vertices and an assignment of colours to the edges, a rainbow Hamilton cycle is a cycle of length $n$ visiting each vertex once and with pairwise different colours on the edges. Similarly (for even $n$) a rainbow…
A long-standing question of the mutual relation between the stack and queue numbers of a graph, explicitly emphasized by Dujmovi\'c and Wood in 2005, was "half-answered" by Dujmovi\'c, Eppstein, Hickingbotham, Morin and Wood in 2022; they…
A graph $G$ is \textit{asymmetric} if its automorphism group of vertices is trivial. Asymmetric graphs were introduced by Erd\H{o}s and R\'{e}nyi in 1963. They showed that the probability of a graph on $n$ vertices being asymmetric tends to…
Orthogonal arrays play a fundamental role in many applications. However, constructing orthogonal arrays with the required parameters for an application usually is extremely difficult and, sometimes, even impossible. Hence there is an…
In this paper we present a geometric approach to discovering some known and some new identities using triangular arrays. Our main aim is to demonstrate how to use the geometric patterns (by Carlitz), in the Pascal and Hosoya triangles to…
In this paper we define a new class of partially filled arrays, called $\lambda$-fold relative Heffter arrays, that are a generalisation of the Heffter arrays introduced by Archdeacon in 2015. After showing the connection of this new…
This paper studies two families of constraints for two-dimensional and multidimensional arrays. The first family requires that a multidimensional array will not contain a cube of zeros of some fixed size and the second constraint imposes…
The hexagonal tiling honeycomb is a beautiful structure in 3-dimensional hyperbolic space. It is called {6,3,3} because each hexagon has 6 edges, 3 hexagons meet at each vertex in a Euclidean plane tiled by regular hexagons, and 3 such…