Results 131 to 140 of about 3,348,536 (356)
Advanced Materials, EarlyView.Using scanning transmission X‐ray microscopy, nonreciprocal spin‐wave behavior is revealed in real space in Fe/Gd multilayers with perpendicular magnetic anisotropy, highlighting their functionality for magnonic logic circuits operating at GHz frequencies.
Ping Che +12 more
wiley +1 more source
Semi-strong split domination in graphs [PDF]
Transactions on Combinatorics, 2014 Given a graph $G = (V,E)$, a dominating set $D subseteq V$ is called a semi-strong split dominating set of $G$ if $|V setminus D| geq 1$ and the maximum degree of the subgraph induced by $V setminus D$ is 1.
Anwar Alwardi +3 more
doaj
On the uniqueness of d-vertex magic constant
Discussiones Mathematicae Graph Theory, 2014 Let G = (V,E) be a graph of order n and let D ⊆ {0, 1, 2, 3, . . .}. For v ∈ V, let ND(v) = {u ∈ V : d(u, v) ∈ D}. The graph G is said to be D-vertex magic if there exists a bijection f : V (G) → {1, 2, . . .
Arumugam S. +2 more
doaj +1 more source
Wiley‐Interscience Series in Discrete Mathematics and Optimization [PDF]
, 2000 openalex +1 more source
Multi‐Scale Modeling of a 3D Soft Magnetoelectric Patch for Wireless Nerve Stimulation
Advanced Materials Interfaces, EarlyView.Core‐shell, magnetoelectric nanoparticles (MENPs) can serve as wireless electric nano‐sources, thanks to their ability to generate high levels of electricity, when stimulated by a human‐safe external magnetic field. By combining MENPs with soft, biocompatible polymeric matrices and optimizing its composite configuration and electrical behavior via ...
Giulia Suarato +6 more
wiley +1 more source
On the nuclear trace of Fourier integral operators
Revista Integración, 2019 In this paper we characterise the r-nuclearity of Fourier integral operators on Lebesgue spaces. Fourier integral operators will be considered in Rn, the discrete group Zn, the n-dimensional torus and symmetric spaces (compact homogeneous manifolds).
Duván Cardona
doaj
A Triple of Heavy Subgraphs Ensuring Pancyclicity of 2-Connected Graphs
Discussiones Mathematicae Graph Theory, 2017 A graph G on n vertices is said to be pancyclic if it contains cycles of all lengths k for k ∈ {3, . . . , n}. A vertex v ∈ V (G) is called super-heavy if the number of its neighbours in G is at least (n+1)/2.
Wide Wojciech
doaj +1 more source
Efficient and Realistic Brain Simulation: A Review and Design Guide for Memristor‐Based Approaches
Advanced Materials Technologies, EarlyView.Memristor‐based emulation of Hodgkin‐Huxley neuron models is investigated, by defining the ideal device characteristics needed for accurate ion‐channel representation and reviewing existing works targeting memristive replication of biological realistic neural behavior.
Lennart Paul Liong Landsmeer +5 more
wiley +1 more source
Advanced Materials Technologies, EarlyView.New theoretical model for vertical contact and separation mode triboelectric nanogenerator is proposed. Detailed derivation process and results are discussed. Numerical solutions and parametric studies are presented. Calculated results are validated by experimental outcomes.
Seokjin Kim +2 more
wiley +1 more source