Results 141 to 150 of about 38,199 (317)
Vector Bond Graph Method of Kineto- static Analysis for Hybrid Driving Five Linkage Mechanism
Jixie chuandong, 2016 For improving the reliability and efficiency of the kineto- static analysis for hybrid driving linkage mechanism,the corresponding vector bond graph method is proposed.
Wang Zhongshuang, Wang Xifeng
doaj
Discrete Mathematics, 1974 AbstractA 3-valent graph G is cyclically n-connected provided one must cut at least n edges in order to separate any two circuits of G. If G is cyclically n-connected but any separation of G by cutting n edges yields a component consisting of a simple circuit, then we say that G is strongly cyclically n-connected.
openaire +1 more source
Graph minors. V. Excluding a planar graph
, 1986 We prove that for every planar graph H there is a number w such that every graph with no minor isomorphic to H can be constructed from graphs with at most w vertices, by piecing them together in a tree structure.
Seymour, P.D, Robertson, Neil
core +1 more source
Advanced Healthcare Materials, EarlyView.This review examines how cellular behavior is regulated by mechanical cues transmitted through soft biomaterials, from single‐cell mechanosensing to tissue‐level adaptation. It highlights why physiological relevance, rather than model complexity alone, is critical for translational mechanobiology and introduces a scoring framework linking material ...
Mathias Polz +9 more
wiley +1 more source
Bioinspired Adaptive Sensors: A Review on Current Developments in Theory and Application
Advanced Materials, EarlyView.This review comprehensively summarizes the recent progress in the design and fabrication of sensory‐adaptation‐inspired devices and highlights their valuable applications in electronic skin, wearable electronics, and machine vision. The existing challenges and future directions are addressed in aspects such as device performance optimization ...
Guodong Gong +12 more
wiley +1 more source
Jixie chuandong, 2013 Through the application of Assur bar groups method and graph theory,the link classification and link composition are finished to get the most basic kinematic chain’s structure of the planar 3-DOF mechanism with full revolute pairs which has three ...
吴凡, 李瑞琴
doaj
Independent Domination In Planar Graph
, 2021 A dominating set D of a planar graph G is an independent dominating set Dip if D is noth independent and dominating set. The authors have generated the maximum independent dominating number of planar graph ( IP ) and minimum independent dominating ...
N. Subashini
core
Advanced Materials, EarlyView.AI‐Assisted Workflow for (Scanning) Transmission Electron Microscopy: From Data Analysis Automation to Materials Knowledge Unveiling. Abstract (Scanning) transmission electron microscopy ((S)TEM) has significantly advanced materials science but faces challenges in correlating precise atomic structure information with the functional properties of ...
Marc Botifoll +19 more
wiley +1 more source
Extending orthogonal planar graph drawings is fixed-parameter tractable
Journal of Computational GeometryThe task of finding an extension to a given partial drawing of a graph while adhering to constraints on the representation has been extensively studied in the literature, with well-known results providing efficient algorithms for fundamental ...
Sujoy Bhore +4 more
doaj +1 more source
Entire choosability of near-outerplane graphs
, 2008 It is proved that if G is a plane embedding of a K4-minor-free graph with maximum degree Δ, then G is entirely 7-choosable if Δ≤4 and G is entirely (Δ+ 2)-choosable if Δ≥ 5; that is, if every vertex, edge and face of G is given a list of max{7,Δ+2 ...
Timothy J. Hetherington +2 more
core +1 more source