Results 81 to 90 of about 713,494 (298)

Random planar graphs

open access: yesJournal of Combinatorial Theory, Series B, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
McDiarmid, C, Steger, A, Welsh, D
openaire   +5 more sources

OntOMat: Toward Ontology‐Based Product and Process Design Engineering and Optimization Solutions Fueling Circular Value Chains

open access: yesAdvanced Engineering Materials, EarlyView.
The OntOMat ontology establishes a structured framework for polymer matrix fiber reinforced composite materials, integrating manufacturing processes, characterization methods, and multiscale design through the VDI/VDE 3682 formalized process description standard.
Nicolas Christ   +19 more
wiley   +1 more source

Planar cycle-extendable graphs [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science
For most problems pertaining to perfect matchings, one may restrict attention to matching covered graphs - that is, connected nontrivial graphs with the property that each edge belongs to some perfect matching.
Aditya Y Dalwadi   +3 more
doaj   +1 more source

Negation Switching Equivalence in Signed Graphs [PDF]

open access: yes, 2010
Unless mentioned or defined otherwise, for all terminology and notion in graph theory the reader is refer to [8].
Reddy, Siva Kota
core   +1 more source

Integration of OpenCV‐Based Microscopic Adhesive Volume Measurement Into a Pyiron Workflow for Automated Data Analysis

open access: yesAdvanced Engineering Materials, EarlyView.
Residual adhesive after electrode loading in adhesive‐assisted resistance spot welding is quantified through a traceable experimental‐to‐digital workflow. Chromatic confocal topography provides calibrated surface‐height data, while OpenCV detects the electrode imprint and integrates adhesive height into comparable volume metrics.
Sung‐Min Wi, Jiangdong Zhao
wiley   +1 more source

Subdivisions in Planar Graphs

open access: yesJournal of Combinatorial Theory, Series B, 1998
Given four distinct vertices in a 4-connected planar graph \(G\), we characterize when the graph \(G\) contains a \(K_4\)-subdivision with the given vertices as its degree three vertices. This result implies the following conjecture of Robertson and Thomas: a 5-connected planar graph has no \(K_4\)-subdivision with specified degree three vertices, if ...
openaire   +2 more sources

Investigating the Effect of Inclination Angle and the Influence of Scan Parameters on the Appearance and Thermal and Mechanical Properties of Filigree Tension Rods of LPBF‐Manufactured NiTi Shape‐Memory Alloys

open access: yesAdvanced Engineering Materials, EarlyView.
This article investigates the dependence of the properties on the manufacturing orientation in the form of the inclination angle to the build plate of LPBF‐fabricated NiTi rods with a diameter of 150–220 µm. Metallographic, chemical, thermal, and mechanical characterization show behavior under identical manufacturing conditions that ranges from ...
Sandra Herzig   +2 more
wiley   +1 more source

Posets and planar graphs [PDF]

open access: yesJournal of Graph Theory, 2005
AbstractUsually dimension should be an integer valued parameter. We introduce a refined version of dimension for graphs, which can assume a value [t − 1 ↕ t], thought to be between t − 1 and t. We have the following two results: (a) a graph is outerplanar if and only if its dimension is at most [2↕3].
Stefan Felsner, William T. Trotter
openaire   +1 more source

Design of a Multistable Finger Prosthesis with Programmable Metamaterials

open access: yesAdvanced Engineering Materials, EarlyView.
This research article shows the development of a multistable programmble metamaterial for the use as a finger prosthesis. The material was designed on different hierarchical levels where the influence of geometrical parameters and combination of mechanical elements was explored.
Franziska Wenz   +5 more
wiley   +1 more source

On a Class of Planar Graphs with Straight-Line Grid Drawings on Linear Area

open access: yesJournal of Graph Algorithms and Applications, 2009
A straight-line grid drawing of a planar graph G is a drawing of G on an integer grid such that each vertex is drawn as a grid point and each edge is drawn as a straight-line segment without edge crossings.
Md. Rezaul Karim, Md. Saidur Rahman
doaj   +1 more source

Home - About - Disclaimer - Privacy