Results 111 to 120 of about 184,015 (290)

A note on vertex partitions

open access: yes, 2011
We prove a general lemma about partitioning the vertex set of a graph into subgraphs of bounded degree. This lemma extends a sequence of results of Lovász, Catlin, Kostochka and Rabern.
openaire   +2 more sources

Nonreciprocal Swarmalators With Reconfigurable and Controllable Formations for Robot Collectives

open access: yesAdvanced Robotics Research, EarlyView.
Nonreciprocal swarmalator interactions are enabled through control barrier functions to transform self‐organizing robot collectives into reconfigurable, constraint‐aware systems. Complex two‐ and three‐dimensional shapes, continuous morphing, obstacle‐aware navigation, collective splitting, and object transport emerge from modulating agent‐level ...
Kush Patel   +3 more
wiley   +1 more source

Graphs obtained from collections of blocks

open access: yesElectronic Journal of Graph Theory and Applications, 2015
Given a collection of $d$-dimensional rectangular solids called blocks, no two of which sharing interior points, construct a block graph by adding a vertex for each block and an edge if the faces of the two corresponding blocks intersect nontrivially ...
Colton Magnant   +2 more
doaj   +1 more source

A Whole‐Head Finite Element Model for Electrical Neuromodulation via Visual Brain‐Machine Interfaces

open access: yesAdvanced Science, EarlyView.
A multimodal, personalized head model is presented that integrates the entire visual pathway with surrounding tissues to simulate electrical stimulation of the optic nerve. In vivo validation in humans and goats, plus systematic component‐elimination analysis, demonstrates the high accuracy of the comprehensive model.
Shengjian Lu   +12 more
wiley   +1 more source

On s-harmonic functions on cones

open access: yesBruno Pini Mathematical Analysis Seminar, 2019
We deal with non negative functions which are s-harmonic on a given cone of the n-dimensional Euclidean space with vertex at zero, vanishing on the complementary.
Stefano Vita
doaj   +1 more source

A Pentaradial and Bilateral Combined Photoreception System in the Sea Cucumber is Mediated by a Blue Light‐Sensitive R‐Opsin

open access: yesAdvanced Science, EarlyView.
The sea cucumber Holothuria leucospilota detects blue and adjacent wavelengths of light via an r‐opsin with a maximum absorption at 459 nm. In the oral tentacles, papillae, and tube feet, distinct light‐sensing structures with specialized morphologies are formed, constituting a unique pentaradial and bilateral combined photoreception system.
Jiasheng Huang   +20 more
wiley   +1 more source

Phase Diagrams and Piezoelectric Properties of Wurtzite Al1−x−yScxGdyN Heterostructural Alloys

open access: yesAdvanced Science, EarlyView.
This study demonstrates ferroelectricity and piezoelectric properties improvement of quaternary wurtzite Al1−x−yScxGdyN${\rm Al}_{1-x-y}{\rm Sc}_x{\rm Gd}_y{\rm N}$ films, guided by density functional theory calculations. Wurtzite Al1−x−yScxGdyN${\rm Al}_{1-x-y}{\rm Sc}_x{\rm Gd}_y{\rm N}$ films have a high optical bandgap, enhanced piezoelectric ...
Julia L. Martin   +11 more
wiley   +1 more source

Elliptic non-Abelian Donaldson-Thomas invariants of ℂ 3

open access: yesJournal of High Energy Physics, 2019
We compute the elliptic genus of the D1/D7 brane system in flat space, finding a non-trivial dependence on the number of D7 branes, and provide an F-theory interpretation of the result.
Francesco Benini   +3 more
doaj   +1 more source

Making Sweat Measurable: Induction, Sampling, and Refreshment in Wearable Biofluid Sensing

open access: yesAdvanced Science, EarlyView.
Wearable sweat sensing relies not only on chemical detection but also on controlled biofluid management. This Review integrates sweat physiology, induction strategies, and microfluidic sampling architectures, demonstrating how flux, transport, and refreshment shape measurement reliability.
Soyoung Shin, Wei Gao
wiley   +1 more source

2K2 vertex-set partition into nonempty parts

open access: yesElectronic Notes in Discrete Mathematics, 2008
Abstract A graph is 2K2-partitionable if its vertex set can be partitioned into four nonempty parts A, B, C, D such that each vertex of A is adjacent to each vertex of B, and each vertex of C is adjacent to each vertex of D. Determining whether an arbitrary graph is 2K2-partitionable is the only vertex-set partition problem into four nonempty parts ...
Simone Dantas   +4 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy