Results 81 to 90 of about 4,115 (305)
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
On Vertex Degree-Based Topological Indices for Fixed Branching Vertices of Trees
Journal of Chemistry, 2022 The Gourava indices and hyper-Gourava indices are graph invariants, related to the degree of vertices of a graph G. Let Tn,b denote the collection of all chemical trees with n vertices where b denotes the number of branching vertices, 1 ...
Muzamil Hanif +3 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
Hypergraphs with infinitely many extremal constructions
Discrete Analysis, 2023 Hypergraphs with infinitely many extremal constructions, Discrete Analysis 2023:18, 34 pp. A fundamental result in extremal graph theory, Turán's theorem, states that the maximal number of edges of a graph with $n$ vertices that does not contain a ...
Jianfeng Hou +4 more
doaj +1 more source
Extremal Results in Random Graphs [PDF]
, 2013 According to Paul Erdős [Some notes on Turán's mathematical work, J. Approx. Theory 29 (1980), page 4] it was Paul Turán who "created the area of extremal problems in graph theory". However, without a doubt, Paul Erdős popularized extremal combinatorics, by his many contributions to the field, his numerous questions and conjectures, and his influence ...
Rödl, Vojtěch, Schacht, Mathias
openaire +2 more sources
Advanced Engineering Materials, EarlyView.A numerical–experimental framework is developed for characterizing multi‐matrix fiber‐reinforced polymers (MM‐FRPs) combining epoxy and polyurethane matrices. Harmonic bending tests are integrated with finite element model updating (FEMU) to simultaneously identify elastic and viscoelastic material parameters.
Rodrigo M. Dartora +4 more
wiley +1 more source
List graphs and distance-consistent node labelings
Electronic Journal of Graph Theory and Applications, 2018 In this paper we consider node labelings c of an undirected connected graph G = (V, E) with labels {1, 2, ..., ∣V∣}, which induce a list distance c(u, v) = ∣c(v) − c(u)∣ besides the usual graph distance d(u, v).
Håkan Lennerstad, Mattias Eriksson
doaj +1 more source
Conditional Matching Preclusion Number of Graphs
Discrete Dynamics in Nature and Society, 2023 The conditional matching preclusion number of a graph G, denoted by mp1G, is the minimum number of edges whose deletion results in the graph with no isolated vertices that has neither perfect matching nor almost-perfect matching.
Yalan Li, Shumin Zhang, Chengfu Ye
doaj +1 more source
On extremal properties of graph entropies
, 2020 We study extremal properties of graph entropies based on so-called information functionals. We obtain some extremality results for the resulting graph entropies which rely on the well-known Shannon entropy.
Veronika Kraus, Matthias Dehmer
core
, 2013 The cycles of length k in a complete graph on n vertices are colored in such a way that edge-disjoint cycles get distinct colors.
Katona, Gyula, Tuza, Zsolt
core +1 more source