Results 61 to 70 of about 1,860,621 (344)
Advanced Functional Materials, EarlyView.Tabular foundation model interrogates the synthetic likelihood of metal−organic frameworks. Abstract Metal–organic frameworks (MOFs) are celebrated for their chemical and structural versatility, and in‑silico screening has significantly accelerated their discovery; yet most hypothetical MOFs (hMOFs) never reach the bench because their synthetic ...
Xiaoyu Wu +3 more
wiley +1 more source
Three infinite families of Hamilton-connected convex polytopes and their detour index
AIMS MathematicsA path in a graph encompassing its whole vertex set is called Hamiltonian. Such a path with sharing the same initial and terminal vertices is called a Hamiltonian cycle. A graph comprising a Hamiltonian path (resp.
Sakander Hayat +3 more
doaj +1 more source
The Color Number of Cubic Graphs Having a Spanning Tree with a Bounded Number of Leaves
Theory and Applications of Graphs, 2021 The color number c(G) of a cubic graph G is the minimum cardinality of a color class of a proper 4-edge-coloring of G. It is well-known that every cubic graph G satisfies c(G) = 0 if G has a Hamiltonian cycle, and c(G) ≤ 2 if G has a Hamiltonian path. In
Analen Malnegro +2 more
doaj +1 more source
Chromatic Roots and Hamiltonian Paths
Journal of Combinatorial Theory, Series B, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Advanced Functional Materials, EarlyView.Permanent magnets derive their extraordinary strength from deep, universal electronic‐structure principles that control magnetization, anisotropy, and intrinsic performance. This work uncovers those governing rules, examines modern modeling and AI‐driven discovery methods, identifies critical bottlenecks, and reveals electronic fingerprints shared ...
Prashant Singh
wiley +1 more source
Hamiltonian Paths in Some Classes of Grid Graphs
Journal of Applied Mathematics, 2012 The Hamiltonian path problem for general grid graphs is known to be NP-complete. In this paper, we give necessary and sufficient conditions for the existence of Hamiltonian paths in L-alphabet, C-alphabet, F-alphabet, and E-alphabet grid graphs.
Fatemeh Keshavarz-Kohjerdi +1 more
doaj +1 more source
On hamiltonian chain saturated uniform hypergraphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 Graphs and ...
Aneta Dudek, Andrzej Zak
doaj +1 more source
Backtracking Algorithms for Constructing the Hamiltonian Decomposition of a 4-regular Multigraph
Моделирование и анализ информационных систем, 2021 We consider a Hamiltonian decomposition problem of partitioning a regular graph into edge-disjoint Hamiltonian cycles. It is known that verifying vertex non-adjacency in the 1-skeleton of the symmetric and asymmetric traveling salesperson polytopes is an
Alexander V. Korostil +1 more
doaj +1 more source
Advanced Functional Materials, EarlyView.Tin hexathiophosphate memristors leverage intrinsic nanopores together with a guided filament formation strategy to regulate titanium ion motion and switching behavior. The devices support reliable nonvolatile memory and reconfigurable logic‐in‐memory, demonstrating 14 Boolean logic functions in a single cell.
Thaw Tint Te Tun +7 more
wiley +1 more source
Parallel Backtracking Algorithm for Hamiltonian Path Search
Communications, 2009 The speed of calculations is a common problem to tackle in many areas of scientific research and real life. This paper presents an implementation of a parallel backtracking algorithm.
Karol Grondzak, Penka Martincova
doaj +1 more source