Results 131 to 140 of about 1,206,642 (268)
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
Hamiltonian path of \(M_ k-v\)
Revista Técnica de la Facultad de Ingeniería, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Eduardo Montenegro +1 more
openaire +2 more sources
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
Tree graph representation of hamiltonian paths
Computers & Mathematics with Applications, 1994 A Hamiltonian path of faces of a polyhedron consists of a sequence of adjacent faces which contains each face exactly once. This paper compares by using tree diagrams the Hamiltonian itineraries versus all possible itineraries of adjacent faces of the five regular polyhedrons. The graphs for the tetrahedron, octahedron and icosahedron are binary trees.
openaire +2 more sources
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
Matching Lagrangian and Hamiltonian simulations in (2+1)-dimensional U(1) gauge theory
European Physical Journal C: Particles and FieldsAt finite lattice spacing, Lagrangian and Hamiltonian predictions differ due to discretization effects. In the Hamiltonian limit, i.e. at vanishing temporal lattice spacing $$a_t$$ a t , the path integral approach in the Lagrangian formalism reproduces ...
C. F. Groß +6 more
doaj +1 more source
Bounded Frequency Lattices in Coupled Lithium Niobate Ring Cavities
Laser &Photonics Reviews, EarlyView.We leverage coupled asymmetric ring resonators in realizing bounded tight‐binding frequency lattices and demonstrate their discrete band structures on an integrated device. Suppression of long‐range coupling with a single auxiliary cavity is demonstrated by combining mode splitting and coupled waveguide dispersion effects.
Hiep Xuan Dinh +5 more
wiley +1 more source
Hamiltonian-laceability of star graphs
, 2020 [[abstract]]Suppose that G is a bipartite graph with its partite sets of equal size. G is said to be strongly Hamiltonian-laceable if there is a Hamiltonian path between every two vertices that belong to different partite sets and there is a path of ...
謝孫源, Hsieh, SY
core
Laser &Photonics Reviews, EarlyView.Room‐temperature lower‐polariton‐like lasing is realized in an InGaN/GaN thin‐film ridge cavity with lateral distributed Bragg reflectors. Near‐field optical microscopy distinguishes the transverse side‐DBR‐confined mode from a longitudinal photon‐like mode, while simulations reproduce their spatial profiles.
Wai Yuen Fu +2 more
wiley +1 more source
A HAMILTONIAN PATH INTEGRAL FOR A DEGENERATE PARABOLIC PSEUDO-DIFFERENTIAL OPERATOR [PDF]
, 1996 The symbol of the fundamental solution for a degenerate parabolic pseudo-differential operator of order m (> 0) can be described in terms of a Hamiltonian path integral. This Hamiltonian path integral converges in the topology of the symbol class S2mλ,
Naoto Kumano-go, KUMANO-GO, NAOTO
core