Results 91 to 100 of about 3,095,070 (339)

On the Hamiltonian Number of a Plane Graph

open access: yesDiscussiones Mathematicae Graph Theory, 2019
The Hamiltonian number of a connected graph is the minimum of the lengths of the closed spanning walks in the graph. In 1968, Grinberg published a necessary condition for the existence of a Hamiltonian cycle in a plane graph, formulated in terms of the ...
Lewis Thomas M.
doaj   +1 more source

Hamiltonian cycles and subsets of discounted occupational measures

open access: yes, 2019
We study a certain polytope arising from embedding the Hamiltonian cycle problem in a discounted Markov decision process. The Hamiltonian cycle problem can be reduced to finding particular extreme points of a certain polytope associated with the input ...
Eshragh, Ali   +3 more
core   +1 more source

Superior Adhesion of Monolayer Amorphous Carbon to Copper

open access: yesAdvanced Materials, EarlyView.
The adhesion energy of monolayer amorphous carbon on copper substrate is 85 J m−2, 13 times higher than that of graphene due to covalent‐like bonding between the sp2 carbon structure to copper. X‐ray photoelectron spectroscopy (XPS), near‐edge X‐ray absorption (NEXAFS), and (density functional theory) DFT calculations are used to elucidate the ...
Hongji Zhang   +27 more
wiley   +1 more source

Local properties of graphs that induce global cycle properties [PDF]

open access: yesOpuscula Mathematica
A graph \(G\) is locally Hamiltonian if \(G[N(v)]\) is Hamiltonian for every vertex \(v\in V(G)\). In this note, we prove that every locally Hamiltonian graph with maximum degree at least \(|V(G)| - 7\) is weakly pancyclic.
Yanyan Wang, Xiaojing Yang
doaj   +1 more source

On hamiltonian chain saturated uniform hypergraphs [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2012
Graphs and ...
Aneta Dudek, Andrzej Zak
doaj   +1 more source

Nash Williams Conjecture and the Dominating Cycle Conjecture [PDF]

open access: yes, 2015
The disproved Nash Williams conjecture states that every 4-regular 4-connected graph has a hamiltonian cycle.
Hoffmann-Ostenhof, Arthur
core  

Mechanical Resonant Sensing of Spin Texture Dynamics in a 2D Antiferromagnet

open access: yesAdvanced Materials, EarlyView.
Detection of antiferromagnetic spin texture in a 2D magnetic crystal is achieved through nanomechanical resonators at radio frequencies. Sharp magnetic transitions that lead to abrupt changes in mechanical linear and nonlinear responses are assigned to antiferromagnetic domain motions.
S M Enamul Hoque Yousuf   +10 more
wiley   +1 more source

Decompositions of Complete Multigraphs into Cyclic Designs

open access: yesJOIV: International Journal on Informatics Visualization, 2020
Let  and  be positive integer,  denote a complete multigraph. A decomposition of a graph  is a set of subgraphs of  whose edge sets partition the edge set of .
Mowafaq Alqadri   +2 more
doaj   +1 more source

On Hamiltonian Paths and Cycles in Sufficiently Large Distance Graphs [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2014
Graph ...
Christian Löwenstein   +2 more
doaj   +1 more source

Radical TADF: Quartet‐Derived Luminescence with Dark TEMPO

open access: yesAdvanced Materials, EarlyView.
A new class of luminescent organic quantum materials is introduced, formed by attaching a stable radical to TADF chromophores. Due to ferromagnetic exchange coupling, a high‐spin quartet state forms upon excitation, which can thermally access a bright state.
Sebastian Gorgon   +8 more
wiley   +1 more source

Home - About - Disclaimer - Privacy