Results 91 to 100 of about 30,716 (267)

Covalent Functionalization of 2D Semiconductors: A Roadmap to Advanced Electronic Devices

Advanced Functional Materials, EarlyView.
This Review presents recent advances in the covalent functionalization strategies for two‐dimensional semiconductors and their implementation in modern technologies. Layered materials are modified through diverse molecular chemistries (e.g., thiols, diazonium salts, alkyl halides, and electron‐deficient species) to tailor their surface properties ...
Ramiro Quirós‐Ovies, Bin Han, Paolo Samorì   +2 more
wiley   +1 more source

Decomposing a Planar Graph into Degenerate Graphs

Journal 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

Nano Borophene as a Programmable 2D Scaffold for Organized DNA Assembly and Long‐Range Energy Transfer

Advanced Functional Materials, EarlyView.
Borophene is introduced as a programmable 2D bio‐interface that organizes DNA through dual boron–sulfur and nucleobase interactions. This molecular architecture enables efficient long‐range nanosurface energy transfer, establishing new design principles for functional nano–bio interfaces and amplification‐free optical biosensing.
Teresa Aditya, Pranay Saha, John M. Sansalone, Shraddha Krishnakumar, Matthew Molinaro, André J. van der Vlies, Nada Maher, Adrienne Griffiths, Zakhro Zakirova, Ketan Dighe, Narayana R. Aluru, Dipanjan Pan   +11 more
wiley   +1 more source

OOPS: Optimized One-Planarity Solver via SAT

Journal of Graph Algorithms and Applications
We present OOPS (Optimized One-Planarity Solver), a practical heuristic for recognizing 1-planar graphs and several important subclasses. A graph is 1-planar if it can be drawn in the plane such that each edge is crossed at most once---a natural ...
Sergey Pupyrev
doaj   +1 more source

Recognizing IC-Planar and NIC-Planar Graphs

Journal of Graph Algorithms and Applications, 2018
We prove that triangulated IC-planar graphs and triangulated $K_5$-free or $X4W$-free NIC-planar graphs can be recognized in cubic time. A graph is 1-planar if it can be drawn in the plane with at most one crossing per edge.
Franz Brandenburg
doaj   +1 more source

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

Advanced 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, Adwait Trikanad, Wei Huang, Taige Hao, David Kisailus, Pablo D. Zavattieri   +5 more
wiley   +1 more source

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

Advanced 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, Federico Rondelli, Francesco Torricelli, Federica Velluto, Anna De Salvo, Michele Di Lauro, Luciano Fadiga, Fabio Biscarini   +7 more
wiley   +1 more source

On the reconstruction of planar graphs

Journal of Combinatorial Theory, Series B, 2007
AbstractWe show that the planarity of a graph can be recognized from its vertex deleted subgraphs, which answers a question posed by Bondy and Hemminger in 1979. We also state some useful counting lemmas and use them to reconstruct certain planar graphs.
Mark Bilinski, Young Soo Kwon, Xingxing Yu   +2 more
openaire   +1 more source

Vector Bond Graph Method of Kineto-static Analysis for Planar Multi-body System with Gear Pair

Jixie chuandong, 2015
In order to increase the reliability and efficiency of the kineto-static analysis of complex planar multi-body system,the corresponding vector bond graph method is proposed.According to the kinematic constraint condition,the vector bond graph model of a ...
Wang Zhongshuang, Zhao Yanwei, Tao Yangyang, Cao Jianguo   +3 more
doaj  

Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends

Journal of Graph Algorithms and Applications, 2016
Given two planar graphs that are defined on the same set of vertices, a RAC simultaneous drawing is a drawing of the two graphs where each graph is drawn planar, no two edges overlap, and edges of one graph can cross edges of the other graph only ...
Michael Bekos, Thomas van Dijk, Philipp Kindermann, Alexander Wolff   +3 more
doaj   +1 more source