Results 101 to 110 of about 836,691 (279)
A Workflow to Accelerate Microstructure‐Sensitive Fatigue Life Predictions
Advanced Engineering Materials, EarlyView.This study introduces a workflow to accelerate predictions of microstructure‐sensitive fatigue life. Results from frameworks with varying levels of simplification are benchmarked against published reference results. The analysis reveals a trade‐off between accuracy and model complexity, offering researchers a practical guide for selecting the optimal ...
Luca Loiodice +2 more
wiley +1 more source
Shortest Paths in Distance-regular Graphs
European Journal of Combinatorics, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bendito, Enrique +2 more
openaire +2 more sources
Advanced Engineering Materials, EarlyView.Geometry‐driven thermal behavior in wire‐arc additive manufacturing (WAAM) influences microstructural evolution during nonequilibrium solidification of a chemically complex Fe–Cr–Nb–W–Mo–C nanocomposite system. By comparing different deposits configurations, distinct entropy–cooling rate correlations, segregation, and carbide evolution are revealed ...
Blanca Palacios +5 more
wiley +1 more source
Assessing Altered Coating Adhesion on Plasma‐Deoxidized Surfaces Under Oxygen‐Free Conditions
Advanced Engineering Materials, EarlyView.This study demonstrates the effectiveness of atmospheric pressure plasma pretreatment in modifying silicon and stainless steel surfaces to improve adhesion. Argon‐hydrogen plasma increases surface roughness and improves adhesion strength, whereas pure argon results in smoother surfaces and structural changes.
Selina Raumel +6 more
wiley +1 more source
The Distance Matrices of Some Graphs Related to Wheel Graphs
Journal of Applied Mathematics, 2013 Let D denote the distance matrix of a connected graph G. The inertia of D is the triple of integers (n+(D), n0(D), n-(D)), where n+(D), n0(D), and n-(D) denote the number of positive, 0, and negative eigenvalues of D, respectively.
Xiaoling Zhang, Chengyuan Song
doaj +1 more source
Advanced Engineering Materials, EarlyView.This study demonstrates how optimizing laser power, scanning speed, and hatching distance in laser powder bed fusion can boost the productivity of Inconel 718 manufacturing by up to 29% while maintaining mechanical integrity. The work delivers a validated process window and cost–time analysis, offering industry‐ready guidelines for efficient additive ...
Amir Behjat +7 more
wiley +1 more source
Minimum Feedback Vertex Sets in Distance Graphs and Circulant Graphs
Discrete Mathematics & Theoretical Computer Science, 2008 For a set D⊂ Z n, the distance graph P n (D) has Z n as its vertex set and the edges are between vertices i and j with |i-j|∈D. The circulant graph C n (D) is defined analogously by considering operations modulo n.
Hamamache Kheddouci, Olivier Togni
doaj
Distance majorization sets in graphs
, 2015 Summary: Let \(G=(V,E)\) be a simple graph. A subset \(D\) of \(V(G)\) is said to be a distance majorization set (or dm-set) if for every vertex \(u\in V-D\), there exists a vertex \(v\in D\) such that \(d(u,v)\geq\deg(u)+\deg(v)\). The minimum cardinality of a dm-set is called the distance majorization number of \(G\) (or dm-number of \(G)\) and is ...
R.SUNDARESWARAN, -, V.SWAMİNATHAN, -
openaire +3 more sources
On distances in generalized Sierpiński graphs
Applicable Analysis and Discrete Mathematics, 2018 In this paper we propose formulas for the distance between vertices of a generalized Sierpi?ski graph S(G, t) in terms of the distance between vertices of the base graph G. In particular, we deduce a recursive formula for the distance between an arbitrary vertex and an extreme vertex of S(G, t), and we obtain a recursive formula for the distance ...
Estrada-Moreno, Alejandro +2 more
openaire +4 more sources