Results 91 to 100 of about 588,772 (275)
Advanced Engineering Materials, Volume 27, Issue 6, March 2025.ErB4 and NdB4 nanostructured powders are produced by mechanochemical synthesis. 5 h mechanical alloying and 4 M HCl acid leaching are used in the production. ErB4 and NdB4 powders exhibit maximum magnetization of 0.4726 emu g−1 accompanied with an antiferromagnetic‐to‐paramagnetic phase transition at about TN = 18 K and 0.132 emu g−1 with a maximum at ...
Burçak Boztemur +5 more
wiley +1 more source
Relation between classes of graphs with interval count k
, 2023 Lívia Salgado Medeiros +2 more
openalex +1 more source
Laser Metal Deposited Ti4822 Hollow Pipe: Experimental and Computational Modelling Study
Advanced Engineering Materials, EarlyView.Laser metal deposition (LMD) of a crack‐free built Ti4822 alloys is challenging. This article reports outstanding characteristics of a hollow pipe that is built with LMD technology when a predicted, nontransformation substrate temperature of 800 °C is used.
Sadiq A. Raji +5 more
wiley +1 more source
Interval Edge-Colorings of Cartesian Products of Graphs I
Discussiones Mathematicae Graph Theory, 2013 A proper edge-coloring of a graph G with colors 1, . . . , t is an interval t-coloring if all colors are used and the colors of edges incident to each vertex of G form an interval of integers.
Petrosyan Petros A. +2 more
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
A Reduction of the Graph Reconstruction Conjecture
Discussiones Mathematicae Graph Theory, 2014 A graph is said to be reconstructible if it is determined up to isomor- phism from the collection of all its one-vertex deleted unlabeled subgraphs. Reconstruction Conjecture (RC) asserts that all graphs on at least three vertices are reconstructible. In
Monikandan S., Balakumar J.
doaj +1 more source
Advanced Engineering Materials, EarlyView.This article presents the NFDI‐MatWerk Ontology (MWO), a Basic Formal Ontology‐based framework for interoperable research data management in materials science and engineering (MSE). Covering consortium structures, research data management resources, services, and instruments, MWO enables semantic integration, Findable, Accessible, Interoperable, and ...
Hossein Beygi Nasrabadi +4 more
wiley +1 more source
Polynomial Time Algorithm for Shortest Paths in Interval Temporal Graphs
AlgorithmsWe develop a polynomial time algorithm for the single-source all destinations shortest paths problem for interval temporal graphs (ITGs). While a polynomial time algorithm for this problem is known for contact sequence temporal graphs (CSGs), no such ...
Anuj Jain, Sartaj Sahni
doaj +1 more source
Advanced Functional Materials, EarlyView.PBTTT‐OR‐R, a C14‐alkoxy/alkyl‐PBTTT polymer derivative, is of substantial interest for optoelectronics due to its specific fullerene intercalation behavior and enhanced charge‐transfer absorption. Comparing this polymer with (S) and without (O) homocoupling defects reveals that PBTTT‐OR‐R(O) forms stable co‐crystals with PC61BM, while PBTTT‐OR‐R(S ...
Zhen Liu +14 more
wiley +1 more source
End Simplicial Vertices in Path Graphs
Discussiones Mathematicae Graph Theory, 2016 A graph is a path graph if there is a tree, called UV -model, whose vertices are the maximal cliques of the graph and for each vertex x of the graph the set of maximal cliques that contains it induces a path in the tree.
Gutierrez Marisa, Tondato Silvia B.
doaj +1 more source