Results 91 to 100 of about 76,992 (320)
Advanced Materials, EarlyView.Pt‐impy and Pt‐Me‐impy exhibit external quantum efficiencies of 24.5% and 27.4% at the 3 wt.% doping concentration, respectively. In particular, Pt‐impy and Pt‐Me‐impy doped blue PhOLEDs optimized for stability demonstrate a device lifetime of up to 95% of the initial luminance of 543 and 228 h at 1000 cd m−2, which has never been achieved in the blue ...
Kiun Cheong +12 more
wiley +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
Hamiltonian decompositions of products of cycles
Discrete Mathematics, 1978 AbstractA graph is said to be decomposable into hamiltonian cycles if its edge set can be partitioned into hamiltonian cycles. We show that the cartesian product of any three cycles can be decomposed into three hamiltonian cycles, thus settling a conjecture by Kotzig.
openaire +1 more source
Spin and Charge Control of Topological End States in Chiral Graphene Nanoribbons on a 2D Ferromagnet
Advanced Materials, EarlyView.Chiral graphene nanoribbons on a ferromagnetic gadolinium‐gold surface alloy display tunable spin and charge states at their termini. Atomic work function variations and exchange fields enabe transitions between singlet, doublet, and triplet configurations.
Leonard Edens +8 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
Decompositions of Complete Multigraphs into Cyclic Designs
JOIV: 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
Cycle spectra of Hamiltonian graphs
Journal of Combinatorial Theory, Series B, 2012 AbstractWe prove that every Hamiltonian graph with n vertices and m edges has cycles with more than p−12lnp−1 different lengths, where p=m−n. For general m and n, there exist such graphs having at most 2⌈p+1⌉ different cycle lengths.
Kevin G. Milans +4 more
openaire +2 more sources
Advanced Materials, EarlyView.We design and implement Au‐Cu co‐modified Zn3In2S6 catalyst with spatially decoupling charge carriers across bulk and surface sites, which effectively suppresses carrier recombination, drives surface hot electron accumulation and stabilizes intermediates for photocatalytic oxygen reduction. The optimized catalyst achieves an H2O2 evolution rate of 94.2
Xiaowen Ruan +10 more
wiley +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
Arc-Disjoint Hamiltonian Cycles in Round Decomposable Locally Semicomplete Digraphs
Discussiones Mathematicae Graph Theory, 2018 Let D = (V,A) be a digraph; if there is at least one arc between every pair of distinct vertices of D, then D is a semicomplete digraph. A digraph D is locally semicomplete if for every vertex x, the out-neighbours of x induce a semicomplete digraph and ...
Li Ruijuan, Han Tingting
doaj +1 more source