Results 101 to 110 of about 757,662 (296)

Mechanics of Telson Ridges in Mantis Shrimp for Impact Analysis and Implications for Bioinspired Elastic Shell Designs

open access: yesAdvanced Functional Materials, EarlyView.
The mantis shrimp telson reveals how ridged biological shields control deformation under impact. Inspired by this architecture, telson‐inspired ridged curved shells transform ridge geometry and macroscopic curvature into bidirectional snap‐through, tunable stiffness, and enhanced hysteretic energy dissipation for multifunctional architected materials ...
Phani Saketh Dasika   +5 more
wiley   +1 more source

Biequivalent Planar Graphs

open access: yesAxioms
We define biequivalent planar graphs, which are a generalisation of the uniform polyhedron graphs, as planar graphs made out of two families of equivalent nodes.
Bernard Piette
doaj   +1 more source

L(2, 1)-Labelings of Some Families of Oriented Planar Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2014
In this paper we determine, or give lower and upper bounds on, the 2-dipath and oriented L(2, 1)-span of the family of planar graphs, planar graphs with girth 5, 11, 16, partial k-trees, outerplanar graphs and cacti.
Sen Sagnik
doaj   +1 more source

Decomposing a Planar Graph into Degenerate Graphs

open access: yesJournal of Combinatorial Theory, Series B, 1995
A graph \(G\) is \(k\)-degenerate if every subgraph of \(G\) has a vertex of degree less than \(k\). The author proves that the vertex set of any planar graph can be decomposed into two sets such that one of them induces a 3-degenerate graph and the other induces a 2-degenerate graph.
openaire   +3 more sources

Analog Classification of Human Hand Gestures Exploiting Dendritic Integration With an Organic Artificial Soma

open access: yesAdvanced Functional Materials, EarlyView.
An organic neuromorphic architecture for the classification of human motor behavior is presented and validated. It performs somatic integration by linearly combining the activity from three muscles. An investigation of synaptic weights is presented and discussed in relationship with the classification performance.
Ilenia Sergi   +7 more
wiley   +1 more source

Beyond Outerplanarity

open access: yesComputing in Geometry and Topology
We study straight-line drawings of graphs where the vertices are placed in convex position in the plane, i.e., convex drawings. We consider two families of graph classes with convex drawings: outer $k$-planar graphs, where each edge is crossed by at ...
Steven Chaplick   +4 more
doaj   +1 more source

I/O-Efficient Algorithms on Near-Planar Graphs

open access: yesJournal of Graph Algorithms and Applications, 2011
Obtaining I/O-efficient algorithms for basic graph problems on sparse directed graphs has been a long-standing open problem. The best known algorithms for most basic problems on such graphs still require Ω(V) I/Os in the worst case, where V is the ...
Herman Haverkort, Laura Toma
doaj   +1 more source

Guanosine‐Quadruplex Hydrogels as Dynamic, Mechanically Tunable and Ion Conductive 3D Scaffolds for Cell Culture Applications

open access: yesAdvanced Functional Materials, EarlyView.
Versatile guanosine‐quadruplex (GQ) hydrogels are developed as dynamic biomatrices for cell culture. These scaffolds are fabricated under mild aqueous conditions, present improved stability, tunable mechanical properties within physiological ranges; fibrillar, porous microstructure, ion conductivity, and cytocompatibility.
Neha Thakur   +10 more
wiley   +1 more source

On the Maximum Independent Set Problem in Subclasses of Planar Graphs

open access: yesJournal of Graph Algorithms and Applications, 2010
The maximum independent set problem is known to be NP-hard in the class of planar graphs. In the present paper, we study its complexity in hereditary subclasses of planar graphs.
Vadim Lozin, Martin Milanič
doaj   +1 more source

Clique Planar Graphs

open access: yesElectronic Notes in Discrete Mathematics, 2001
Abstract Abstract We generalize the idea of extended triangles of a graph G by considering a family of completes of G instead of the clique family of G. We characterize Helly and 3 - Helly Planar Graphs using extended triangles. We prove that if a planar graph is a clique graph then any one of its extended triangles is a clique graph.
Liliana Alcón, Marisa Gutierrez
openaire   +2 more sources

Home - About - Disclaimer - Privacy