Results 101 to 110 of about 174,518,636 (296)
Associating a red‐NIR phosphorescent octahedral hexanuclear molybdenum cluster compound with hexaethyleneoxide chains bearing mesogenic units on both ends leads to an emissive hybrid liquid crystal showing mesomorphism on a very unusual temperature range down to −25°C.
Killiann Heinz +11 more
wiley +1 more source
On the measure of polynomials attaining maxima on a vertex [PDF]
We calculate the probability that a k-homogeneous polynomial in n variables attain a local maximum on a vertex in terms of the “sharpness” of the vertex, and then study the dependence of this measure on the growth of dimension and degree.
Ignacio Zalduendo +3 more
core +1 more source
A hexahedral mesh connectivity compression with vertex degrees
This paper introduces a new algorithm for the compression of manifold hexahedral meshes topology, using vertex degree. The topology compression consists of two parts-the mesh's boundary consisting of quadrilaterals is compressed first, and then the hexahedra are processed by the help of six commands.
Krivograd, Sebastian +2 more
openaire +3 more sources
Phase Engineering of Atomically Precise Nanoclusters (APNCs) of Gold and Beyond
Engineering the structural phase of materials is of paramount importance for both fundamental research and practical applications. In this Review, we summarize the recent progress in controlling the phases of atomically precise nanoclusters (APNCs) of gold, silver and copper, as well as bimetallic systems. The phase‐enabled material properties of APNCs
Yitong Wang +4 more
wiley +1 more source
Relating Sombor and Euler indices
Introduction/purpose: The Euler-Sombor index (EU) is a new vertexdegree-based graph invariant, obtained by geometric consideration. It is closely related to the Sombor index (SO). The actual form of this relation is established.
Ivan Gutman
doaj +1 more source
Total vertex irregularity strength of trees with maximum degree five
In 2010, Nurdin, Baskoro, Salman and Gaos conjectured that the total vertex irregularity strength of any tree T is determined only by the number of vertices of degrees 1, 2 and 3 in T. This paper will confirm this conjecture by considering all trees with
S. Susilawati +2 more
doaj +1 more source
A Parameterized Algorithm for Bounded-Degree Vertex Deletion [PDF]
The $d$-bounded-degree vertex deletion problem, to delete at most $k$ vertices in a given graph to make the maximum degree of the remaining graph at most $d$, finds applications in computational biology, social network analysis and some others. It can be regarded as a special case of the $(d+2)$-hitting set problem and generates the famous vertex cover
openaire +3 more sources
Co1/3TaS2${\rm Co}_{1/3}{\rm TaS}_{2}$ hosts a triple‐Q noncoplanar antiferromagnetic state with coexisting Z3${\rm Z}_3$ electronic nematicity. We report rotational hysteresis observed in both magnetoresistance and magnetic torque, revealing strongly pinned in‐plane weak ferromagnetic moments in the triple‐Q phase and the magnetism‐driven nature of ...
Joonyoung Choi +5 more
wiley +1 more source
The rhenadicarbaborane carbonyl nitrosyls (C2Bn−3Hn−1)Re(CO)2(NO), (n = 8 to 12), of interest in drug delivery agents based on the experimentally known C2B9H11Re(CO)2(NO) and related species, have been investigated by density functional ...
Amr A. A. Attia +3 more
doaj +1 more source
Strong Fully Reprocessable Engineered Wood Composites
Engineering a hyperbranched adhesive with complementary imine‐bond and hydrogen‐bond networks, combining it with wood particles to fabricate the wood composite (WP/HTP) under mild hot‐pressing conditions. The WP/HTP exhibits 100% mechanical strength recovery after three cycles of reprocessing, and the reprocessed modulus of rupture (MOR) and modulus of
Xilin Zhang +9 more
wiley +1 more source

