Results 51 to 60 of about 1,206,642 (268)
Graphs with many hamiltonian paths
Involve, a Journal of MathematicsA graph is \emph{hamiltonian-connected} if every pair of vertices can be connected by a hamiltonian path, and it is \emph{hamiltonian} if it contains a hamiltonian cycle. We construct families of non-hamiltonian graphs for which the ratio of pairs of vertices connected by hamiltonian paths to all pairs of vertices approaches 1. We then consider minimal
Carlson, Erik +5 more
openaire +3 more sources
On Hamiltonian paths in distance graphs
Applied Mathematics Letters, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Christian Löwenstein +2 more
openaire +1 more source
Proper Hamiltonian Paths in Edge-Coloured Multigraphs [PDF]
Graphs and Combinatorics, 2011 Given a $c$-edge-coloured multigraph, a proper Hamiltonian path is a path that contains all the vertices of the multigraph such that no two adjacent edges have the same colour. In this work we establish sufficient conditions for an edge-coloured multigraph to guarantee the existence of a proper Hamiltonian path, involving various parameters as the ...
Raquel Águeda +5 more
openaire +8 more sources
The Importance of Metal‐Organic Framework Linker Atoms for CO2 Reduction: A DFT Study
Advanced Science, EarlyView.Using DFT, we examine the role of linker atoms in CO2 reduction on copper‐based metal organic frameworks (Cu MOFs). Our calculations reveal that linker atoms may serve as both CO2 and H‐shuttling sites and suggest linker electrostatics as a descriptor for linker activity. ABSTRACT Although the metal within the secondary building unit of a metal‐organic
Ugochukwu Nwosu, Samira Siahrostami
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
Advanced Science, EarlyView.First‐principles calculations reveal that monolayer In2O${\rm In}_2{\rm O}$ hosts type‐II Dirac fermions near the Fermi level, which split into Weyl points under spin‐orbit coupling. The material exhibits negative and giant magnetoresistance, a pronounced spin Hall effect, and phonon‐mediated superconductivity at 1.5 K, establishing it as a unique ...
Qing‐Bo Liu +6 more
wiley +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
Diverse Landscape of Tunable Magnetic, Topological, and Ferroelectric States in 2D Ti3Se3Te2
Advanced Science, EarlyView.Ti3Se3Te2 emerges as a multifunctional 2D van der Waals platform. The monolayer is a dynamically stable ferromagnetic quantum anomalous Hall insulator. In bilayers, two stacking configurations yield distinct phases: AA‐stacking hosts an altermagnetic quantum spin Hall insulator, while AA′‐stacking exhibits three‐state in‐plane ferroelectricity ...
Jiangtao Yu +5 more
wiley +1 more source
Hamiltonian paths through two- and three-dimensional grids
, 2005 This paper addresses the existence of Hamiltonian paths and cycles in two-dimensional grids consisting of triangles or quadrilaterals, and three-dimensional grids consisting of tetrahedra or hexahedra. The paths and cycles may be constrained to pass from
Mitchell, W.F.
core +1 more source
Efficient Screening of Organic Singlet Fission Molecules Using Graph Neural Networks
Advanced Science, EarlyView.A high‐throughput screening framework based on graph neural networks (GNNs) and multi‐level validation facilitates the identification of singlet fission (SF) candidates. By efficiently predicting excitation energies across 20 million molecules, and integrating TDDFT calculations, synthetic accessibility assessments, and GW+BSE calculations, this ...
Li Fu +5 more
wiley +1 more source