Results 91 to 100 of about 975,712 (248)
Planar Graph Classifier - Generated Graph Images
These images were generated with networkx layout algorithms and matplotlib graph visualization from the graph input datasets of the Planar Graph Classifier.
Hummel, Matthias
core +1 more source
Biodegradable and Biocompatible Functional Polymers for Biomedical Applications
Biodegradable and biocompatible functional polymers integrate electrical, mechanical, and stimuli‐responsive functionalities while enabling programmed degradation under physiological conditions. This review introduces recent advances in conductive, shape‐memory, self‐healing, photocurable, and adhesive polymer systems, emphasizing material design ...
Won Bae Han +5 more
wiley +1 more source
1-Visibility Representations of 1-Planar Graphs
A 1-visibility representation of a graph displays each vertex as a horizontal vertex-segment, called a bar, and each edge as a vertical edge-segment between the segments of the vertices, such that each edge-segment crosses at most one vertex-segment and ...
Franz Brandenburg
doaj +1 more source
On the planarity of jump graphs
Let \(G\) be a graph of size \(m\geq 1\) and let \(F\) and \(H\) be edge-induced subgraphs of \(G\) of size \(k\) with \(1\leq k\leq m\). In the literature is then defined the \(k\)-jump distance from \(F\) to \(H\). For a graph \(G\) of size \(m\geq 1\) and an integer \(k\) with \(1\leq k\leq m\), the \(k\)-jump graph \(J_k(G)\) is defined as a graph ...
Héctor Hevia +2 more
openaire +2 more sources
Conformational Switching of Proteins on Material Surfaces Enabled by Peptide‐Oriented Adsorption
Responsive biointerfaces could be achieved using conformationally responsive proteins; however, their interconversion can be lost upon surface adsorption. Herein, we demonstrate that the incorporation a Au binding peptide into calmodulin allows for binding control on Au wherein the protein retains conformational switching. This capability was confirmed
Sakthirupini Ramamurthy +7 more
wiley +1 more source
Augmenting the Connectivity of Planar and Geometric Graphs
In this paper we study connectivity augmentation problems. Given a connected graph G with some desirable property, we want to make G 2-vertex connected (or 2-edge connected) by adding edges such that the resulting graph keeps the property.
Ignaz Rutter, Alexander Wolff
doaj +1 more source
A Sufficient Condition for Planar Graphs of Maximum Degree 6 to be Totally 7-Colorable
A total k-coloring of a graph is an assignment of k colors to its vertices and edges such that no two adjacent or incident elements receive the same color.
Enqiang Zhu, Yongsheng Rao
doaj +1 more source
On the reconstruction of planar graphs
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 +2 more
openaire +1 more source
Bio‐Inspired Artificial Ionic Mechanoreceptor
A skin‐inspired artificial mechanoreceptor based on ionic interactions is presented for biomimetic tactile sensing. Pressure‐driven ionic redistribution within microfluidic channels generates a self‐powered electrical signal without external bias. The generated waveform exhibits mechanoreceptor‐like temporal features, including overshoot and undershoot,
Mohammad Akbari +4 more
wiley +1 more source
This study advances SafeWax, a bio‐inspired, fatty‐acids‐based superhydrophobic coating, by identifying an agriculturally compliant solvent and revealing how solvent‐controlled Fatty acid crystallization governs the coating's microscopic structure and performance.
Niv Ben‐Arie +13 more
wiley +1 more source

