Results 111 to 120 of about 605,731 (305)

Architecture‐Driven Sensor Stability in Weft‐Knitted Engineering Textiles

open access: yesAdvanced Engineering Materials, EarlyView.
Textile‐integrated sensor architectures are systematically compared to evaluate their electromechanical behavior under combined mechanical and environmental loading. Pocket‐based integration exhibits stable and reproducible signals, whereas tunnel‐based routing shows higher sensitivity accompanied by increased variability.
Adnan Maroof Khan   +5 more
wiley   +1 more source

On the harmonic index of bicyclic graphs

open access: yesCommunications in Combinatorics and Optimization, 2018
The harmonic index of a graph $G$‎, ‎denoted by $H(G)$‎, ‎is defined as‎ ‎the sum of weights $2/[d(u)+d(v)]$ over all edges $uv$ of $G$‎, ‎where‎ ‎$d(u)$ denotes the degree of a vertex $u$‎. ‎Hu and Zhou [Y‎. ‎Hu and X‎. ‎Zhou‎, ‎WSEAS Trans‎. ‎Math‎. ‎
R. Rasi
doaj   +1 more source

Graph polynomials for a class of DI-pathological graphs

open access: yesAKCE International Journal of Graphs and Combinatorics, 2020
Let be a simple graph. A dominating set is a set such that the closed neighborhood of is the entire vertex set. An independence set of a graph is a subset of vertices that are pairwise non-adjacent.
James M. Hammer, Joshua Harrington
doaj   +1 more source

Asymptotically extremal polynomials with respect to varying weights and application to Sobolev orthogonality [PDF]

open access: yes, 2008
9 pages, no figures.-- MSC2000 code: 33C45.MR#: MR2431543 (2009g:41009)Zbl#: Zbl 1155.33006We study the asymptotic behavior of the zeros of a sequence of polynomials whose weighted norms, with respect to a sequence of weight functions, have the same $n ...
Díaz Mendoza, Carlos J.   +3 more
core   +1 more source

Fabrication Routes for Ionic Conducting Fiber Strain Sensors

open access: yesAdvanced Engineering Materials, EarlyView.
Ionic conducting fiber strain sensors (ICFSs) offer compliant, textile‐integrable sensing. Thus far, the commercialization of ICFSs has been constrained by fiber fabrication routes. This review provides a fabrication‐centric analysis of ICFSs correlating processing strategies with material properties and scalability.
Leo John Kershaw   +3 more
wiley   +1 more source

Wearable Smart Patches on Sustainable Chitosan With Reversible Microbial Growth‐Inhibitory Properties

open access: yesAdvanced Functional Materials, EarlyView.
ABSTRACT Chitosan, a polysaccharide upcycled from biowaste, has long promised sustainable, biocompatible, and antimicrobial films and devices, an appeal reinforced by its recent regulatory recognition, with several chitosan‐based antibacterial dressings gaining clearance through the Food and Drug Administration's 510(k) pathway.
Jacopo Nicoletti   +16 more
wiley   +1 more source

Two Short Proofs on Total Domination

open access: yesDiscussiones Mathematicae Graph Theory, 2013
A set of vertices of a graph G is a total dominating set if each vertex of G is adjacent to a vertex in the set. The total domination number of a graph Υt (G) is the minimum size of a total dominating set.
Bickle Allan
doaj   +1 more source

Rare Events, Temporal Dependence and the Extremal Index [PDF]

open access: yes
AMS classifications: 60G70; 62G32;block maximum;exceedance;extremal index;failure set;mixing condition;M4 process;rare event;stationary ...
Segers, J.J.J.
core  

Bio‐Inspired Synthesis of Macroporous Single Crystal Particles as Scattering Agents

open access: yesAdvanced Functional Materials, EarlyView.
A general strategy is presented that delivers unique, single‐crystal microparticles that combine submicron macroporosity and uniform particle shapes. A bioinspired approach is used to occlude three distinct types of additives – polystyrene microspheres, polymer vesicles and amino acids – within calcite single crystals, and subsequent thermal annealing ...
Stephanie E. Foster   +11 more
wiley   +1 more source

On the Numbers of Cut-Vertices and End-Blocks in 4-Regular Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2014
A cut-vertex in a graph G is a vertex whose removal increases the number of connected components of G. An end-block of G is a block with a single cut-vertex.
Wang Dingguo, Shan Erfang
doaj   +1 more source

Home - About - Disclaimer - Privacy