Related papers: Horadam cubes
We consider a one-parameter family of piecewise isometries of a rhombus. The rotational component is fixed, and its coefficients belong to the quadratic number field $K=\mathbb{Q}(\sqrt{2})$. The translations depend on a parameter $s$ which…
We give a necessary and sufficient condition for a cubic graph to be Hamiltonian by analyzing Eulerian tours in certain spanning subgraphs of the quartic graph associated with the cubic graph by 1-factor contraction. This correspondence is…
A graph $G$ is {\em matching-decyclable} if it has a matching $M$ such that $G-M$ is acyclic. Deciding whether $G$ is matching-decyclable is an NP-complete problem even if $G$ is 2-connected, planar, and subcubic. In this work we present…
We investigate a family of one dimensional maps for which the bifurcation diagram looks differently than the usual ones. We describe and exemplify various unique and interesting phenomena arising for this family of maps.
The enumeration of Hamiltonian cycles on 2n*2n grids of nodes is a longstanding problem in combinatorics. Previous work has concentrated on counting all cycles. The current work enumerates nonisomorphic cycles -- that is, the number of…
The Fibonacci cube $\Gamma_n$ is obtained from the $n$-cube $Q_n$ by removing all the vertices that contain two consecutive 1s. If, in addition, the vertices that start and end with 1 are removed, the Lucas cube $\Lambda_n$ is obtained. The…
This paper shows NP-completeness for finding Hamiltonian cycles in induced subgraphs of the dual graphs of semi-regular tessilations. It also shows NP-hardness for a new, wide class of graphs called augmented square grids. This work follows…
In this paper we consider the existence of Hamilton cycles in the random graph $G=G_{n,m}^{\delta\geq 3}$. This a random graph chosen uniformly from the set of graphs with vertex set $[n]$, $m$ edges and minimum degree at least 3. Our…
Many polynomial invariants are defined on graphs for encoding the combinatorial information and researching them algebraically. In this paper, we introduce the cycle polynomial and the path polynomial of directed graphs for counting cycles…
In Graph Theory a number of results were devoted to studying the computational complexity of the number modulo 2 of a graph's edge set decompositions of various kinds, first of all including its Hamiltonian decompositions, as well as the…
Properties of the recently reported homogeneous Hilbert curves are deduced and reported. The nature of the affine transformations involved in the construction of the Hilbert curves is explored. The analytical representation of proper and…
In this paper we will study some properties of the matrix representations of symbol algebras of degree three, we study some equations with coefficients in these algebras, we find an octonion algebra in a symbol algebra of degree three, we…
We study a class of complex polynomial equations on a finite graph with a view to understanding how holistic phenomena emerge from combinatorial structure. Particular solutions arise from orthogonal projections of regular polytopes,…
We initiate the study of Hamiltonian cycles up to symmetries of the underlying graph. Our focus lies on the extremal case of Hamiltonian-transitive graphs, i.e., Hamiltonian graphs where, for every pair of Hamiltonian cycles, there is a…
Strongly regular graphs are highly symmetrical and can be described fully with just a few parameters yet the existence of many of them is still under the question. Due to this uncertainty, it is of immense interest to study their structure,…
We establish a quadratic identity for the Yamada polynomial of ribbon cubic graphs in 3-space, extending the Tutte golden identity for planar cubic graphs. An application is given to the structure of the flow polynomial of cubic graphs at…
In light of Lov\'{a}sz's longstanding question on the existence of Hamilton paths in vertex-transitive graphs, this paper considers a natural variant: what if vertex-transitivity is relaxed, yet a high degree of symmetry--specifically…
We extend our investigation of $2$-determinants, which we defined in a previous paper. For a linear homogenous recurrence of the second order, we consider relations between different sequences satisfying the same linear homogeneous…
Let $G$ be a finite group. A number of graphs with the vertex set $G$ have been studied, including the power graph, enhanced power graph, and commuting graph. These graphs form a hierarchy under the inclusion of edge sets, and it is useful…
We continue the development of methods for enumerating nodal curves on smooth complex surfaces, stressing the range of validity. We illustrate the new methods in three important examples. First, for up to eight nodes, we confirm…