Results 71 to 80 of about 211,073 (326)
Advanced Engineering Materials, EarlyView.This article provides an overview of recent advancements in bulk processing of rare‐earth‐free hard magnetic materials. It also addresses related simulation approaches at different scales. The research on rare‐earth‐free magnetic materials has increased significantly in recent years, driven by supply chain issues, environmental and social concerns, and
Daniel Scheiber, Andrea Bachmaier
wiley +1 more source
Computing Planarity in Computable Planar Graphs
Graphs and Combinatorics, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Oscar Levin, Taylor McMillan
openaire +2 more sources
Challenges during Flash Lamp Annealing of Aerosol‐Deposited Barium Titanate Films
Advanced Engineering Materials, EarlyView.Aerosol deposition is used to rapidly deposit barium titanate films with thicknesses ranging from 2 to 16 μm at room temperature, eliminating the need for further densification. However, to recover the electromechanical properties, annealing is required, which limits the usage of temperature‐sensitive substrates.
Michel Kuhfuß +7 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
On Edge Colorings of 1-Planar Graphs without 5-Cycles with Two Chords
Discussiones Mathematicae Graph Theory, 2019 A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this paper, it is proved that every 1-planar graph with maximum degree ∆ ≥ 8 is edge-colorable with ∆ colors if each of its 5-cycles contains ...
Sun Lin, Wu Jianliang
doaj +1 more source
On (p, 1)-Total Labelling of Some 1-Planar Graphs
Discussiones Mathematicae Graph Theory, 2021 A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this paper, it is proved that the (p, 1)-total labelling number (p ≥ 2) of every 1-planar graph G is at most Δ(G) + 2p − 2 provided that Δ (G) ≥
Niu Bei, Zhang Xin
doaj +1 more source
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
Longer Cycles in Essentially 4-Connected Planar Graphs
Discussiones Mathematicae Graph Theory, 2020 A planar 3-connected graph G is called essentially 4-connected if, for every 3-separator S, at least one of the two components of G − S is an isolated vertex.
Fabrici Igor +3 more
doaj +1 more source
Advanced Engineering Materials, EarlyView.Plasma‐assisted hybrid friction stir welding of dissimilar AlCu joints employs localized plasma preheating to balance heat input and enhance plastic flow. The optimized process reduces axial force by up to 35%, refines the microstructure, and achieves ≈96% joint efficiency.
Deepak Kumar Yaduwanshi +3 more
wiley +1 more source
DP-4-Colorability on Planar Graphs Excluding 7-Cycles Adjacent to 4- or 5-Cycles
MathematicsIn order to resolve Borodin’s Conjecture, DP-coloring was introduced in 2017 to extend the concept of list coloring. In previous works, it is proved that every planar graph without 7-cycles and butterflies is DP-4-colorable.
Fan Yang, Xiangwen Li, Ziwen Huang
doaj +1 more source