Results 31 to 40 of about 4,036,327 (265)
Hamilton cycle decompositions of the tensor product of complete multipartite graphs
Discrete Mathematics, 2008 R. Manikandan, P. Paulraja
semanticscholar +3 more sources
Identifying Hamilton cycles in the Cartesian product of directed cycles
AKCE International Journal of Graphs and Combinatorics, 2020 Let be a Cartesian product of directed cycles. It is known that has a Hamilton cycle if there is a permutation of that satisfies and for some positive integers , where . In addition, if then has two arc-disjoint Hamilton cycles.
Zbigniew R. Bogdanowicz
doaj +1 more source
On Implicit Heavy Subgraphs and Hamiltonicity of 2-Connected Graphs
Discussiones Mathematicae Graph Theory, 2021 A graph G of order n is implicit claw-heavy if in every induced copy of K1,3 in G there are two non-adjacent vertices with sum of their implicit degrees at least n. We study various implicit degree conditions (including, but not limiting to, Ore- and Fan-
Zheng Wei, Wideł Wojciech, Wang Ligong
doaj +1 more source
Journal of Business Cycle Research, 2021 Within a New Zealand business cycle context, we assess whether Hamilton’s (H84) OLS regression methodology produces stylised business cycle facts which are materially different from the Hodrick–Prescott (HP) and Baxter–King (BK) measures, and whether ...
V. Hall, P. Thomson
semanticscholar +1 more source
Well-spread sequences and edge-labellings with constant Hamilton-weight [PDF]
Discrete Mathematics & Theoretical Computer Science, 2004 A sequence (a_i) of integers is \emphwell-spread if the sums a_i+a_j, for ...
Peter Mark Kayll
doaj +1 more source
Sparse Kneser graphs are Hamiltonian [PDF]
, 2020 For integers $k\geq 1$ and $n\geq 2k+1$, the Kneser graph $K(n,k)$ is the graph whose vertices are the $k$-element subsets of $\{1,\ldots,n\}$ and whose edges connect pairs of subsets that are disjoint.
Mütze, Torsten +2 more
core +3 more sources
Finding Hamilton cycles in random intersection graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 The construction of the random intersection graph model is based on a random family of sets. Such structures, which are derived from intersections of sets, appear in a natural manner in many applications. In this article we study the problem of finding a
Katarzyna Rybarczyk
doaj +1 more source
Hamilton cycles in hypergraphs below the Dirac threshold [PDF]
, 2018 We establish a precise characterisation of $4$-uniform hypergraphs with minimum codegree close to $n/2$ which contain a Hamilton $2$-cycle. As an immediate corollary we identify the exact Dirac threshold for Hamilton $2$-cycles in $4$-uniform hypergraphs.
Garbe, Frederik, Mycroft, Richard
core +2 more sources
Powers of Hamilton cycles in pseudorandom graphs [PDF]
, 2014 We study the appearance of powers of Hamilton cycles in pseudorandom graphs, using the following comparatively weak pseudorandomness notion. A graph $G$ is $(\varepsilon,p,k,\ell)$-pseudorandom if for all disjoint $X$ and $Y\subset V(G)$ with $|X|\ge ...
A. Johansson +18 more
core +1 more source
Difference divisor graph of the finite group [PDF]
International Journal of Research in Industrial Engineering, 2018 Let (Zn, +) be a finite group of integers modulo n and Dn a non-empty subset of Zn containing proper devisors of n. In this paper, we have introduced the difference divisor graph Diff (Zn, Dn) associated with Zn whose vertices coincide with Zn such that ...
R. V M S S Kiran Kumar, T. Chalapathi
doaj +1 more source