Results 51 to 60 of about 3,218,251 (319)
Calculating the number of Hamilton cycles in layered polyhedral graphs
Comput. Math. Methods, 2020 We describe a method for computing the number of Hamilton cycles in cubic polyhedral graphs. The Hamilton cycle counts are expressed in terms of a finite-state machine, and can be written as a matrix expression.
Lukas N. Wirz +2 more
semanticscholar +1 more source
Loose Hamilton Cycles in Regular Hypergraphs [PDF]
Combinatorics, Probability and Computing, 2014 We establish a relation between two uniform models of randomk-graphs (for constantk⩾ 3) onnlabelled vertices: ℍ(k)(n,m), the randomk-graph with exactlymedges, and ℍ(k)(n,d), the randomd-regulark-graph. By extending the switching technique of McKay and Wormald tok-graphs, we show that, for some range ofd = d(n)and a constantc> 0, ifm~cnd, then one ...
Dudek, Andrzej +3 more
openaire +2 more sources
Method to generate the pseudo random sequence based on the statistical properties
网络与信息安全学报, 2017 There are some problems existing in pseudo-random sequence generating methods, such as the weaker proportionality, bad run length characteristic, etc. Hence, based on the SimiHam algorithm in Knight's tour problem, a pseudo-random sequences generating ...
Sen BAI, Long-fu ZHOU, Hui GUO, Bing YAN
doaj +3 more sources
Hamilton ℓ-cycles in uniform hypergraphs
Journal of Combinatorial Theory, Series A, 2010 v3: corrected very minor error in Lemma 4.6 and the proof of Lemma 6 ...
Kühn, Daniela +2 more
openaire +2 more sources
Economies, 2022 Okun’s law is formulated as the ratio between GDP and unemployment (UE): β = f(GDP/UE). It is used to investigate the relations between output and labor input across regions or across business cycles. Based on results by James D. Hamilton we replaced the
Knut Lehre Seip, Dan Zhang
doaj +1 more source
Pattern Colored Hamilton Cycles in Random Graphs [PDF]
SIAM Journal on Discrete Mathematics, 2017 We consider the existence of patterned Hamilton cycles in randomly colored random graphs. Given a string $\Pi$ over a set of colors $\{1,2,\ldots,r\}$, we say that a Hamilton cycle is $\Pi$-colored if the pattern repeats at intervals of length $|\Pi|$ as
Michael Anastos, A. Frieze
semanticscholar +1 more source
Psyche: A Journal of Entomology, 1994 Copulation between individually marked nestmates of the Neotropical eusocial wasp Polistes instabilis is reported. Polistes copulations are rarely observed in the field; this observation is the first documented case of nestmate copulation in the genus ...
Sean O'Donnell
doaj +1 more source
Grafos hamiltonianos en el diseño de viajes
Modelling in Science Education and Learning, 2013 The existence and, if applicable, the location of paths with given properties is a topic in graph theory. One of these problems is to find routes through all points, only once, starting and ending at the same node.
Cristina Jordán Lluch +1 more
doaj +1 more source
Comparison of HP Filter and the Hamilton’s Regression
Mathematics, 2022 In this paper we examine if the use of Hamilton’s regression filter significantly modifies the cyclical components concerning unemployment in Greece compared with those using the Hodrick–Prescott double filter (HP).
Melina Dritsaki, Chaido Dritsaki
doaj +1 more source
On Rainbow Hamilton Cycles in Random Hypergraphs [PDF]
Electronic Journal of Combinatorics, 2017 Let $H_{n,p,r}^{(k)}$ denote a randomly colored random hypergraph, constructed on the vertex set $[n]$ by taking each $k$-tuple independently with probability $p$, and then independently coloring it with a random color from the set $[r]$. Let $H$ be a $k$
A. Dudek, Sean English, A. Frieze
semanticscholar +1 more source