Related papers: On four state Hard Core Models on the Cayley Tree

We consider the SOS (solid-on-solid) model, with spin values $0,1,2$, on the Cayley tree of order two (binary tree). We treat both ferromagnetic and antiferromagnetic coupling, with interactions which are proportional to the absolute value…

We provide four equivalent combinatorial conditions for a simple assembly graph (rigid vertex graph where all vertices are of degree 1 or 4) to have the largest number of Hamiltonian sets of polygonal paths relative its size. These…

We continue and extend previous work on the parameterized complexity analysis of the NP-hard Stable Roommates with Ties and Incomplete Lists problem, thereby strengthening earlier results both on the side of parameterized hardness as well…

We establish tight lower and upper bounds on the number of edges in traceable graphs in several classes of dense graphs. A graph is traceable if it has a Hamiltonian path. We show that the bound is: - quadratic for the class of graphs of…

Recently it was proved that usual (real) Potts model on a Cayley tree has up to $2^q-1$ translation-invariant Gibbs measures. This paper is devoted to description of translation- invariant $p$-adic Gibbs measures (TIpGMs) of the $p$-adic…

Bedrossian characterized all pairs of forbidden subgraphs for a 2-connected graph to be Hamiltonian. Instead of forbidding some induced subgraphs, we relax the conditions for graphs to be Hamiltonian by restricting Ore- and Fan-type degree…

Let $G$ be a graph with adjacency matrix $A$. The transition matrix of $G$ is denoted by $H(t)$ and it is defined by $H(t):=\exp{\left(itA\right)},\;t\in\mathbb{R}.$ The graph $G$ has perfect state transfer (PST) from a vertex $u$ to…

An arc of a graph is an oriented edge and a 3-arc is a 4-tuple $(v,u,x,y)$ of vertices such that both $(v,u,x)$ and $(u,x,y)$ are paths of length two. The 3-arc graph of a graph $G$ is defined to have vertices the arcs of $G$ such that two…

In the present paper we continue the investigation from [1] and consider the SOS (solid-on-solid) model on the Cayley tree of order $k \geq 2$. In the ferromagnetic SOS case on the Cayley tree, we find three solutions to a class of period-4…

We provide a computer-assisted proof that if G is any finite group of order kp, where k < 48 and p is prime, then every connected Cayley graph on G is hamiltonian (unless kp = 2). As part of the proof, it is verified that every connected…

Let $t>0$ be a real number and $G$ be a graph. We say $G$ is $t$-tough if for every cutset $S$ of $G$, the ratio of $|S|$ to the number of components of $G-S$ is at least $t$. Determining toughness is an NP-hard problem for arbitrary…

Manifestly non-Hermitian quantum graphs with real spectra are introduced and shown tractable as a new class of phenomenological models with several appealing descriptive properties. For illustrative purposes, just equilateral star-graphs…

The past decade has seen a flourishing of advances in harmonic analysis of graphs. They lie at the crossroads of graph theory and such analytical tools as graph Laplacians, Markov processes and associated boundaries, analysis of path-space,…

We consider a finite range lattice models on Cayley tree with two basic properties: the existence of only a finite number of ground states and with Peierls type condition. We define notion of a contour for the model on the Cayley tree. By a…

We apply modern methods in computational topology to the task of discovering and characterizing phase transitions. As illustrations, we apply our method to four two-dimensional lattice spin models: the Ising, square ice, XY, and…

In the paper, we consider the $\lambda$-model with spin values $\{1, 2, 3\}$ on the Cayley tree of order two. We first describe ground states of the model. Moreover, we also proved the existence of translation-invariant Gibb measures for…

We revisit the classical hard-core model, also known as independent set and dual to vertex cover problem, where one puts particles with a first-neighbor hard-core repulsion on the vertices of a random graph. Although the case of random…

In this paper we construct several models with nearest-neighbor interactions and with the set $[0,1]$ of spin values, on a Cayley tree of order $k\geq 2$. We prove that each of the constructed model has at least two translational-invariant…

For a fixed set ${\cal H}$ of graphs, a graph $G$ is ${\cal H}$-subgraph-free if $G$ does not contain any $H \in {\cal H}$ as a (not necessarily induced) subgraph. A recently proposed framework gives a complete classification on ${\cal…

Given graphs $H$ and $G$, possibly with vertex-colors, a homomorphism is a function $f:V(H)\to V(G)$ that preserves colors and edges. Many interesting counting problems (e.g., subgraph and induced subgraph counts) are finite linear…