Results 91 to 100 of about 29,288 (268)
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 +3 more
doaj
Pathwidth of 2-Layer k-Planar Graphs
Computing in Geometry and TopologyA bipartite graph G = (X ∪ Y, E) is a 2-layer k-planar graph if it admits a drawing on the plane such that the vertices in X and Y are placed on two parallel lines respectively, edges are drawn as straight-line segments, and every edge involves at most ...
Yuto Okada
doaj +1 more source
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 +3 more
doaj +1 more source
Biodegradable and Biocompatible Functional Polymers for Biomedical Applications
Advanced Functional Materials, EarlyView.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
On the planarity of jump graphs
Discrete Mathematics, 2000 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 +1 more source
Catalytically Enhanced Near Room‐Temperature Hydrogen Sensing Using Pd‐ZnO Colloidal Crystals
Advanced Functional Materials, EarlyView.Pd‐decorated ZnO colloidal crystal monolayers demonstrate excellent performance across a wide hydrogen concentration range at 33°C, with high selectivity and reproducible device fabrication. The sensors show strong responses even at low‐ppm H2 concentrations and an ultra‐low detection limit of 82 ppb, indicating their suitability for diverse hydrogen ...
Hamidah Alluhaybi +13 more
wiley +1 more source
On the Synthesis of Planar Graphs with Given Properties
Кібернетика та комп'ютерні технологіїThe problem of studying the structural properties of planar subgraphs G\v, where v is an arbitrary vertex of a graph G of undirected genus, is considered, using cell chains that connect limit cycles with points of a given set M of the graph G\v.
Volodymyr Petrenjuk, Dmytro Petreniuk
doaj +1 more source
CoRR, 2018 We show that for any $k \geq 0$, there exists a planar graph which is $B_{k+1}$-CPG but not $B_k$-CPG. As a consequence, we obtain that $B_k$-CPG is a strict subclass of $B_{k+1}$-CPG.
Nicolas Champseix +2 more
openaire +2 more sources
A Novel Decellularized Fibrocartilage Graft Promotes Tympanic Membrane Repair
Advanced Healthcare Materials, EarlyView.An off‐the‐shelf decellularized porcine meniscus fibrocartilage graft (MEND) is engineered for pediatric tympanoplasty. Featuring a microchannel architecture that promotes host cell invasion, MEND rapidly closes tympanic membrane perforations and fully remodels in vivo, outperforming fascia and matching cartilage grafts while avoiding donor‐site ...
Paul M. Gehret +6 more
wiley +1 more source
Journal of Graph Algorithms and Applications, 2017 We introduce a new type of graph drawing called "rook-drawing". A rook-drawing of a graph $G$ is obtained by placing the $n$ nodes of $G$ on the intersections of a regular grid, such that each row and column of the grid supports exactly one node.
David Auber +3 more
doaj +1 more source