Results 81 to 90 of about 3,139,455 (314)
Hamiltonian cycles on random Eulerian triangulations [PDF]
Nuclear Physics B, 1999 22 pages, 9 figures, references and a comment ...
Guitter, E. +2 more
openaire +4 more sources
Advanced Materials, EarlyView.Magnetic doping of the topological insulator Bi2Te3 with erbium adatoms induces out‐of‐plane magnetism and breaks time‐reversal symmetry, opening a Dirac gap and driving a Fermi surface transition from hexagonal to star‐of‐David geometry. Microscopy, spectroscopy, and magnetic dichroism reveal atomically controlled magnetic interactions that tailor the
Beatriz Muñiz Cano +18 more
wiley +1 more source
Subgraphs intersecting any hamiltonian cycle
Journal of Combinatorial Theory, Series B, 1988 Let G be a subgraph of K(n), the complete graph on n vertices, such that (i) its edges cannot be represented by fewer than k vertices, (ii) every hamiltonian cycle of K(n) contains at least one edge of G and no proper subgraph of G has this property. P. Erdős posed the question of determining min e(G).
openaire +1 more source
Advanced Materials, EarlyView.A high‐capacity polyimide‐linked porous organic polymer (HAT‐PTO) incorporating numerous redox‐active centers is synthesized via a hydrothermal reaction, delivering a high theoretical capacity of 484 mAh g−1. In situ hybridization with carboxyl‐functionalized multiwalled carbon nanotubes enhances conductivity and stability, achieving 397 mAh g−1 at C ...
Arindam Mal +7 more
wiley +1 more source
Advanced Photonics Research, EarlyView.This review highlights recent advances in accelerating luminescence in nanostructures through cooperative emission, resonator coupling, and nonlocal light–matter interactions. By unifying concepts such as excitonic superradiance, superfluorescence, and the plasmonic Purcell effect, it reveals physical limits of ultrafast emission and their potential ...
Masaaki Ashida +3 more
wiley +1 more source
Local properties of graphs that induce global cycle properties [PDF]
Opuscula MathematicaA 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
2-Connected Hamiltonian Claw-Free Graphs Involving Degree Sum of Adjacent Vertices
Discussiones Mathematicae Graph Theory, 2020 For a graph H, define σ¯2(H)=min{d(u)+d(v)|uv∈E(H)}{{\bar \sigma }_2} ( H ) = \min \left\{ {d ( u ) + d ( v )|uv \in E ( H )} \right\} . Let H be a 2-connected claw-free simple graph of order n with δ(H) ≥ 3. In [J. Graph Theory 86 (2017) 193–212], Chen
Tian Tao, Xiong Liming
doaj +1 more source
Decoding Human Placental Cellular and Molecular Responses to Obesity and Fetal Growth
Advanced Science, EarlyView.Women with obesity often deliver large‐for‐gestational‐age (LGA) infants. Single‐nucleus RNA sequencing of term placenta reveals that hypoxia and TNF‐α signaling in syncytiotrophoblasts are featured in maternal obesity, but inflammatory signatures in Hofbauer cells and response to lipid or carbohydrate metabolism in fibroblasts are specific to LGA.
Hong Jiang +12 more
wiley +1 more source
Discussiones Mathematicae Graph Theory, 2020 Let S = (a1,. . . , am; b1, . . . , bn), where a1, . . . , am and b1, . . . , bn are two sequences of nonnegative integers. We say that S is a bigraphic pair if there exists a simple bipartite graph G with partite sets {x1, x2, . . . , xm} and {y1, y2, .
Yin Jian-Hua, Li Sha-Sha
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