Results 71 to 80 of about 18,159 (263)
On a Class of Planar Graphs with Straight-Line Grid Drawings on Linear Area
Journal 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
Advanced Engineering Materials, EarlyView.This review comprehensively evaluates extrusion‐based additive manufacturing for advanced ceramics, detailing feedstock options and key process parameters. By critically addressing defect mechanisms like porosity and cracking, the work highlights optimization strategies through machine learning and advanced postprocessing.
Meisam Bakhtiari +4 more
wiley +1 more source
Electronic Notes in Discrete Mathematics, 2001 Abstract Abstract We generalize the idea of extended triangles of a graph G by considering a family of completes of G instead of the clique family of G. We characterize Helly and 3 - Helly Planar Graphs using extended triangles. We prove that if a planar graph is a clique graph then any one of its extended triangles is a clique graph.
Liliana Alcón, Marisa Gutierrez
openaire +1 more source
Advanced Engineering Materials, EarlyView.During creep of a single‐crystal Ni‐based superalloy, the overall crystal orientation is observed to remain constant while the microstructure evolves. Despite the lack of macroscopic rotation, small (<1°) rotations are observed on the submicron size scale and are accommodated by counteracting rotations over the scale of several micrometers.
E. J. Payton +3 more
wiley +1 more source
Advanced 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
Planarization of Clustered Graphs [PDF]
, 2002 We propose a planarization algorithm for clustered graphs and experimentally test its efficiency and effectiveness. Further, we integrate our planarization strategy into a complete topology-shape-metrics algorithm for drawing clustered graphs in the orthogonal drawing convention.
Di Battista G. +2 more
openaire +2 more sources
Advanced Engineering Materials, EarlyView.We apply a foundational machine‐learning interatomic potential based on the graph atomic cluster expansion (GRACE) to simulate the commercial Ni‐based single‐crystal superalloy CMSX‐4. Hybrid Monte‐Carlo/molecular dynamics sampling resolves short‐range order in the γ phase and L12 sublattice occupancies in the γ’ phase and connects them to stacking ...
Aditya Vishwakarma +4 more
wiley +1 more source
Laser‐Induced Graphene from Waste Almond Shells
Advanced Functional Materials, EarlyView.Almond shells, an abundant agricultural by‐product, are repurposed to create a fully bioderived almond shell/chitosan composite (ASC) degradable in soil. ASC is converted into laser‐induced graphene (LIG) by laser scribing and proposed as a substrate for transient electronics.
Yulia Steksova +9 more
wiley +1 more source
On the depth of a planar graph
Discrete Mathematics, 1976 AbstractIn this paper, we have defined the concept of the depth of a planar graph. We show that, if G is a simple finite planar graph with p vertices and q edges and q > 3(p − 1) − p/2s−1, then the depth of G is at least equal to s.
Vinay G. Kane, Sanat K. Basu
openaire +2 more sources
Advanced Functional Materials, EarlyView.P4bm framework in NaNbO3‐Ba(Ti, Hf)O3 ferrodistortive relaxor entails short‐range and highly‐polar ferrodistortive orders. The abundant highly‐polar orders facilitate to increase entropy change, and robust octahedral oxygen tilt enables to impede thermal perturbations.
Feng Li +11 more
wiley +1 more source