Results 141 to 150 of about 889,165 (240)
ENERGY &ENVIRONMENTAL MATERIALS, EarlyView.Low‐dimensional materials (0D, 1D, and 2D) exhibit unique electronic and physicochemical properties, enabling advanced nanoelectronic and optoelectronic devices. Mixed‐dimensional heterostructures combine these materials to enhance functionality.
Qaisar Alam +3 more
wiley +1 more source
On Link-disjoint Hamiltonian Cycles of Torus networks
, 1997 The problem of embedding link-disjoint Hamiltonian cycles into torus networks is addressed. The maximum number of link-disjoint cycles is limited to half the degree of the node in a regular network.
Latifi, Shahram, Zheng, S. Q.
core +1 more source
Long Cycles in Chromatic Digraphs Spanned by Hamiltonian Directed Paths
MathematicsLet C be any oriented cycle on n vertices. We show that every (10n−4)-chromatic digraph spanned by a Hamiltonian directed path contains a subdivision of C.
Salman Ghazal, Nadine Dirani
doaj +1 more source
Recent progress of the exchange bias based on 2D van der Waals ferromagnet
InfoScience, EarlyView.Ultrathin magnetic materials could help make smaller, energy‐efficient memories, but their magnetic states must remain stable and controllable. This review brings together recent research on exchange bias, a magnetic pinning effect in layered materials, and explains how interfaces and electrical, thermal or mechanical controls can tune it, with optical
Wajahat Ali, Shaojie Hu
wiley +1 more source
The problem of finding two edge-disjoint hamiltonian cycles [PDF]
, 2012 In this paper we consider an approach to solve the problem of finding two edge-disjoint Hamiltonian cycles.
Gorbenko, A., Popov, V.
core
InfoScience, EarlyView.Pseudomagnetic fields make light and sound emulate charged particles in magnetic fields, enabling magnetic‐free signal processing. This Review summarizes their origins, three implementations in two‐dimensional artificial lattices, and applications in energy localization and robust transport, guiding the design of topological integrated devices ...
Shuaihu Liu +5 more
wiley +1 more source
Equivalent Formulation of Thomassen's Conjecture Using Tutte Paths in Claw‐Free Graphs
Journal of Graph Theory, EarlyView.ABSTRACT We continue studying Thomassen's conjecture (every 4‐connected line graph has a Hamilton cycle) in the direction of a recently shown equivalence with Jackson's conjecture (every 2‐connected claw‐free graph has a Tutte cycle), and we extend the equivalent formulation as follows: In every connected claw‐free graph, any two vertices are connected
Adam Kabela +2 more
wiley +1 more source
Edge-disjoint Hamiltonian cycles in two-dimensional torus
International Journal of Mathematics and Mathematical Sciences, 2004 Myung M. Bae +2 more
doaj +1 more source
Journal of Graph Theory, EarlyView.ABSTRACT A 2‐edge‐coloured graph G $G$ is called locally complete if for each vertex v $v$, the vertices adjacent to v $v$ through edges of the same colour induce a complete subgraph in G $G$. Locally complete 2‐edge‐coloured graphs have nice properties, and there exists a polynomial algorithm to decide whether such a graph has an alternating ...
Jørgen Bang‐Jensen, Jing Huang
wiley +1 more source
Hamiltonian cycles in subdivided doubles
Ars Mathematica ContemporaneaThe subdivided double construction on 4-regular graphs was used by Potočnik and Wilson to explore semi-symmetric (edge-transitive but not vertex-transitive) graphs, and can be used to construct every semi-symmetric 4-regular graph that contains a pair of twin vertices.
openaire +2 more sources