Results 71 to 80 of about 908,664 (294)

On the degrees of a strongly vertex-magic graph

open access: yesDiscrete Mathematics, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Camino Balbuena   +8 more
openaire   +2 more sources

A Holistic Platform Approach for Developing Robust Pulmonary mRNA Delivery: Integrating Novel Phenolic Acid‐Derived Ionizable Lipids and Device Engineering

open access: yesAdvanced Functional Materials, EarlyView.
An integrated pulmonary mRNA delivery platform combining novel biodegradable syringic acid‐derived ionizable lipids, design‐of‐experiments formulation optimization, and vibrating‐mesh nebulizer engineering enabled stable aerosolization and efficient lung delivery.
Neha Kaushal   +21 more
wiley   +1 more source

Vertex Degree Weighted Path Indices

open access: yesActa Chimica Slovenica, 2016
Vertex degree weighted path indices P(N)(a, b, ...), for example P(1)(a, b), P(2)(a, b, c), P(3)(a, b, c, d), and P(4)(a, b, c, d, e), are good topological indices for some of the physicochemical properties of octanes with |R|(max) up to 0.999. Mutually optimized combinations of them are even better, R (P(1)..P(4)) is in the worst tested case > 0.9 ...
openaire   +5 more sources

In Situ Magnetic Ordering and Microfabrication of Liquid Crystal Networks with Discretized Alignment

open access: yesAdvanced Functional Materials, EarlyView.
Miniaturizing liquid crystal network actuators typically demands costly laser writing or digital light processing. A low‐cost photolithography platform couples rotating photomasks with a Halbach magnetic array to discretize in‐plane molecular alignment down to 50 µm, producing programmable, light‐responsive grippers, checkerboards, and origami‐inspired
Matthew Gene Scarfo   +3 more
wiley   +1 more source

Limit distributions of the number of vertices with given degree in a conditional configuration graph

open access: yesTransactions of the Karelian Research Centre of the Russian Academy of Sciences, 2016
We consider configuration graphs with N vertices. The degrees of the vertices are independent identically distributed random variables according to power-law distribution. Node degrees form semiedges that are numbered in an arbitrary order.
Yury Pavlov
doaj   +1 more source

Limits to the Hall Effect and Other Nonreciprocal Effects in Three‐Dimensional Metamaterials

open access: yesAdvanced Materials, EarlyView.
Comprehensive and fundamental bounds on nonreciprocal effects in three‐dimensional metamaterials are derived. They reveal that the effective Hall mobility cannot exceed the largest constituent mobility, that, under certain conditions, the Verdet constant cannot be enhanced, and that, for constituents with Hall coefficients of the same sign, the largest
Christian Kern, Graeme W. Milton
wiley   +1 more source

On the chromatic number of graphs with some restriction of vertex degrees

open access: yesУчёные записки Казанского университета: Серия Физико-математические науки, 2020
Graphs, for which the degree of a certain vertex is equal to (d + 1) and the degrees of all other vertices are at most d , d ≥ 3 , were considered. Properties were obtained to color vertices of these graphs in d colors.
S.N. Selezneva
doaj   +1 more source

Weak In‐Plane Ferromagnetism and Electronic Nematicity in the Distorted Triple‐Q Magnetic Phase of Co1/3TaS2

open access: yesAdvanced Materials, EarlyView.
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

A Note on the Minimum Wiener Polarity Index of Trees with a Given Number of Vertices and Segments or Branching Vertices

open access: yesDiscrete Dynamics in Nature and Society, 2021
The Wiener polarity index of a graph G, usually denoted by WpG, is defined as the number of unordered pairs of those vertices of G that are at distance 3. A vertex of a tree with degree at least 3 is called a branching vertex.
Sadia Noureen   +2 more
doaj   +1 more source

A Thickness-Invariant Origami Robot With Integrated Actuation and Multimodal Locomotion. [PDF]

open access: yesAdv Sci (Weinh)
A thickness‐invariant variation on the Yoshimura origami pattern is used as the basis of a robot, allowing power, actuation, and control systems to be embedded within the thickened panels of the pattern. The robot uses multiple kinematic branches to achieve distinct modes of locomotion, such as walking, running, galloping, and turning. ABSTRACT Origami
Wing D   +4 more
europepmc   +2 more sources

Home - About - Disclaimer - Privacy