Related papers: Hamiltonian paths on the Sierpinski gasket
We study the number of acyclic orientations on the generalized two-dimensional Sierpinski gasket $SG_{2,b}(n)$ at stage $n$ with $b$ equal to two and three, and determine the asymptotic behaviors. We also derive upper bounds for the…
We investigate asymptotical behavior of numbers of long Hamiltonian walks (HWs), i.e. self-avoiding random walks that visit every site of a lattice, on various fractal lattices. By applying an exact recursive technique we obtain scaling…
We study Hamiltonian walks (HWs) on the family of three--dimensional modified Sierpinski gasket fractals, as a model for compact polymers in nonhomogeneous media in three dimensions. Each member of this fractal family is labeled with an…
We study Hamiltonian walks (HWs) on Sierpinski and $n$--simplex fractals. Via numerical analysis of exact recursion relations for the number of HWs we calculate the connectivity constant $\omega$ and find the asymptotic behaviour of the…
We present the numbers of dimer-monomers on the Sierpinski gasket $SG_d(n)$ at stage $n$ with dimension $d$ equal to two, three and four, and determine the asymptotic behaviors. The corresponding results on the generalized Sierpinski gasket…
Let S be a set of distinct points in general position in the Euclidean plane. A plane Hamiltonian path on S is a crossing-free geometric path such that every point of S is a vertex of the path. It is known that, if S is sufficiently large,…
We determine the asymptotics of the largest cardinality of a set of Hamilton paths in the complete graph with vertex set [n] under the condition that for any two of the paths in the family there is a subpath of length k entirely contained…
In this paper, we introduce a new method to construct evolving networks based on the construction of the Sierpinski gasket. Using self-similarity and renewal theorem, we obtain the asymptotic formula for average path length of our evolving…
For integer $n$, the $n$-iterated line graph $L^n(G)$ of an undirected graph $G$ is defined to be $L(L^{n-1}(G))$, where $L^1(G)$ is the line graph $L(G)$ of $G$. In this paper we introduce hamiltonian path index. Hamiltonian path index,…
Xiong and Liu [L. Xiong and Z. Liu, Hamiltonian iterated line graphs, Discrete Math. 256 (2002) 407-422] gave a characterization of the graphs $G$ for which the $n$-th iterated line graph $L^n(G)$ is hamiltonian, for $n\ge2$. In this paper,…
We consider the doubly infinite Sierpinski gasket graph $SG_0$, rescale it by factor $2^{-n}$, and on the rescaled graphs $SG_n=2^{-n}SG_0$, for every $n\in \mathbb{N}$, we investigate the limit shape of three aggregation models with…
We study the free path length and the geometric free path length in the model of the periodic two-dimensional Lorentz gas (Sinai billiard). We give a complete and rigorous proof for the existence of their distributions in the…
We study the function $H_n(C_{2k})$, the maximum number of Hamilton paths such that the union of any pair of them contains $C_{2k}$ as a subgraph. We give upper bounds on this quantity for $k\ge 3$, improving results of Harcos and…
If the edges of the complete graph $K_n$ are totally ordered, a simple path whose edges are in ascending order is called increasing. The worst-case length of the longest increasing path has remained an open problem for several decades, with…
Let $G$ be a fixed graph. Two paths of length $n-1$ on $n$ vertices (Hamiltonian paths) are $G$-different if there is a subgraph isomorphic to $G$ in their union. In this paper we prove that the maximal number of pairwise triangle-different…
We obtain the Lifschitz tail asymptotics for the integrated density of states of the subordinate $\alpha-$stable processes on the Sierpi\'nski gasket $\mathcal G,$ evolving among killing Poissonian obstacles. Simultaneously, we derive the…
Finding Hamitonian Cycles in square grid graphs is a well studied and important questions. More recent work has extended these results to triangular and hexagonal grids, as well as further restricted versions. In this paper, we examine a…
The number of independent sets is equivalent to the partition function of the hard-core lattice gas model with nearest-neighbor exclusion and unit activity. We study the number of independent sets $m_{d,b}(n)$ on the generalized Sierpinski…
We study the number of connected spanning subgraphs $f_{d,b}(n)$ on the generalized Sierpinski gasket $SG_{d,b}(n)$ at stage $n$ with dimension $d$ equal to two, three and four for $b=2$, and layer $b$ equal to three and four for $d=2$. The…
There was recent interest in Motzkin paths without peaks (peak: up-step followed immediately by down-step); additional results about this interesting family is worked out. The new results are the enumeration of such paths that live in a…