Results 101 to 110 of about 1,206,642 (268)
Hamiltonian Strongly Regular Graphs [PDF]
We give a sufficient condition for a distance-regular graph to be Hamiltonian. In particular, the Petersen graph is the only connected non-Hamiltonian strongly regular graph on fewer than 99 vertices.Distance-regular graphs;Hamilton cycles JEL ...
Brouwer, A.E., Haemers, W.H.
core
Bayesian Adaptive Hamiltonian Monte Carlo with an Application to High-Dimensional BEKK GARCH Models [PDF]
Hamiltonian Monte Carlo (HMC) is a recent statistical procedure to sample from complex distributions. Distant proposal draws are taken in a equence of steps following the Hamiltonian dynamics of the underlying parameter space, often yielding superior ...
John Maheu, Martin Burda
core +2 more sources
Graphs with Many Hamiltonian Paths
, 2023 A graph is hamiltonian-connected if every pair of vertices can be connected by a hamiltonian path, and it is hamiltonian if it contains a hamiltonian cycle. Every hamiltonian-connected graph is hamiltonian.
Zhang, Xingyi +4 more
core
DISTRIBUTED HAMILTONIAN PATH SEARCH ALGORITHM
, 2010 Mnohé praktické problémy v doprave môžu byť transformované na problém hľadania hamiltonovskej cesty alebo kružnice. Je dokázané, že tento problém je NP-úplný, takže môže byť časovo náročný pre úlohy riešené v praxi.
Grondžák, Karol
core +1 more source
Powers of Hamiltonian paths in interval graphs [PDF]
Journal of Graph Theory, 1998 Summary: We give a simple proof that the obvious necessary conditions for a graph to contain the \(k\)th power of a Hamiltonian path are sufficient for the class of interval graphs. The proof is based on showing that a greedy algorithm tests for the existence of Hamiltonian path powers in interval graphs.
openaire +3 more sources
From Artificial to Embodied and Physical Intelligence in Smart Manufacturing
Advanced Science, EarlyView.Smart manufacturing is reframed through complementary artificial, embodied, and physical intelligence, spanning computational reasoning, perception‐action coupling, and material‐level adaptation. Their integration across design, fabrication, operation, and maintenance reveals how intelligence can be co‐designed across algorithms, embodied agents, and ...
Kang Wang +9 more
wiley +1 more source
On k-path hamiltonian line-graphs
, 1972 La nota riguarda principalmente i grafi di linee k-path hamiltoniani. Si indicano delle proprietà del grafo di linee di un grafo k-path hamiltoniano e si assegnano delle condizioni sufficienti affinché il grafo di linee di un grafo sia k-path ...
Zamfirescu, Tudor
core
Hamiltonian connectedness and a matching in powers of connected graphs [PDF]
, 1995 summary:In this paper the following results are proved: 1. Let $P_n$ be a path with $n$ vertices, where $n \geq5$ and $n \not= 7,8$. Let $M$ be a matching in $P_n$. Then $(P_n)^4 - M$ is hamiltonian-connected. 2. Let $G$ be a connected graph of order $p \
Wisztová, Elena
core +1 more source
Hamiltonian chromatic number of block graphs
Journal of Graph Algorithms and Applications, 2017 Let $G$ be a simple connected graph of order $n$. A hamiltonian coloring $c$ of a graph $G$ is an assignment of colors (non-negative integers) to the vertices of $G$ such that $D(u, v)$ + $|c(u) - c(v)|$ $\geq$ $n - 1$ for every two distinct vertices $u$
Devsi Bantva
doaj +1 more source
Hamiltonian Path in Split Graphs- a Dichotomy
CoRR, 2017 In this paper, we investigate Hamiltonian path problem in the context of split graphs, and produce a dichotomy result on the complexity of the problem. Our main result is a deep investigation of the structure of $K_{1,4}$-free split graphs in the context of Hamiltonian path problem, and as a consequence, we obtain a polynomial-time algorithm to the ...
P. Renjith, N. Sadagopan
openaire +3 more sources