Results 51 to 60 of about 116,934 (311)
Discussiones Mathematicae Graph Theory, 2015 For integers k and n with 2 ≤ k ≤ n − 1, a graph G of order n is k-path pancyclic if every path P of order k in G lies on a cycle of every length from k + 1 to n. Thus a 2-path pancyclic graph is edge-pancyclic.
Bi Zhenming, Zhang Ping
doaj +1 more source
Fostering Innovation: Streamlining Magnetocaloric Materials Research by Digitalization
Advanced Engineering Materials, EarlyView.Magnetocaloric cooling (MCE) is an environmentally friendly refrigeration method with great potential. Optimizing MCE materials involves the preparation and screening of large quantities of samples, which in turn generates a large amount of data. A digitalization approach is presented that uses ontologies, knowledge graphs, and digital workflows to ...
Simon Bekemeier +17 more
wiley +1 more source
Ferroelectricity in Antiferromagnetic Wurtzite Nitrides
Advanced Functional Materials, EarlyView.We establish MnSiN2${\rm MnSiN}_2$ and MnGeN2${\rm MnGeN}_2$ as aristotypes of a new multiferroic wurtzite family that simultaneously exhibits ferroelectricity and antiferromagnetism with altermagnetic spin splitting. By strategically substituting alkaline‐earth metals, we predict new materials with coexisting switchable polarization, spin texture, and
Steven M. Baksa +3 more
wiley +1 more source
Hamiltonian paths and hamiltonian connectivity in graphs
Discrete Mathematics, 1993 A degree and neighborhood type condition on independent triples of vertices of a graph \(G\) that implies \(G\) is hamiltonian-connected is given. In particular, the following is proved. If \(G\) is a 3-connected graph of order \(n\) such that \(d(u) + d(v) + d(w)-| N(u) \cap N(v) \cap N(w) | \geq n+1,\) then \(G\) is hamiltonian-connected.
openaire +2 more sources
On Critical Behaviour in Systems of Hamiltonian Partial Differential Equations [PDF]
, 2015 We study the critical behaviour of solutions to weakly dispersive Hamiltonian systems considered as perturbations of elliptic and hyperbolic systems of hydrodynamic type with two components.
Klein, Christian +13 more
core +1 more source
Polarizable Vanadium Dipoles Promote Water Dissociation on Vanadium‐Based Metal Organic Framework
Advanced Functional Materials, EarlyView.The polarization of unpaired V 3d electrons weakens the H─O bond to improve water dissociation by the dual Vδ+:O─H and Pλ−:H─O coupling hydrogen bonds formation and relaxation. P@V‐MOF electrocatalyst shows low overpotentials (94 mV in acid, 178 mV in neutral, and 77 mV in alkaline solutions) with excellent stability for effective overall water ...
Xinjuan Liu +13 more
wiley +1 more source
Orbital Geometry‐Governed Response of Pressure‐Tunable Quantum Defects in hBN
Advanced Functional Materials, EarlyView.Defects in hBN act as ultrasensitive quantum manometers when the energy of the intradefect optical transitions is modified by lattice compression. The orbital geometry of the electron wave functions governs how electron hopping and Coulomb interactions react uniquely to the reduction of the van der Waals gap and in‐plane compression, leading to robust ...
Magdalena Grzeszczyk +6 more
wiley +1 more source
Exciton Binding Energy of Phosphorescent Emitter Molecules in Organic Light‐Emitting Diodes
Advanced Functional Materials, EarlyView.Energy level alignment is key to efficient OLED design, yet determining LUMO energies remains challenging. A methodology based on field‐induced dissociation and kinetic Monte Carlo simulations is presented to extract LUMO energies of iridium‐based phosphorescent emitters from their exciton binding energy.
Hiroki Tomita +6 more
wiley +1 more source
On Hamiltonian properties of powers of special Hamiltonian graphs [PDF]
Colloquium Mathematicum, 1974 Abstract : Several results on the powers of connected graphs are extended. In particular, it is shown that if G is an n-hamiltonian graph of order p > or = 5, then G sup m is (n+2m-2)-hamiltonian for all m > or = 1 and n + 2m or = 3, the graph G sup m is (P - the set((p-n)/m))-hamiltonian connected. (Author)
Chartrand, G., Kapoor, S. F.
openaire +3 more sources