Results 51 to 60 of about 55,995 (279)
Advanced Engineering Materials, EarlyView.This study investigates thermo‐chemical processes during high‐temperature testing of two commercial MgO‐C brick grades, one containing 47.5 wt.% MgO‐C recyclate. Using ETV, DTA/TG‐MS, XRD, and SEM/EDS/EBSD, mechanisms such as carbothermal reduction of magnesia, impurity incorporation into the secondary MgO surface layer, and calcium‐rich phase ...
Alexander Schramm +6 more
wiley +1 more source
Tree Centroid Properties Clarification
Моделирование и анализ информационных систем, 2017 The paper is devoted to the tree centroid properties clarification. Attention of the authors was attracted by the popular problem of (binary) partition of a graph. The solution is known only by brute force algorithm.
Yurii A. Belov, Sergei I. Vovchok
doaj +1 more source
Distinguishing Number and Distinguishing Index of the Join of Two Graphs [PDF]
Mathematics Interdisciplinary Research, 2019 The distinguishing number (index) D(G) (D'(G)) of a graph G is the least integer d such that G has an vertex labeling (edge labeling) with d labels that is preserved only by a trivial automorphism. In this paper we study the distinguishing number and the
Saeid Alikhani, Samaneh Soltani
doaj +1 more source
Three-Partition Hodge Integrals and the Topological Vertex [PDF]
Communications in Mathematical Physics, 2019 44 pages, 2 ...
Toshio Nakatsu, Kanehisa Takasaki
openaire +2 more sources
Influence of an Oxygen‐Free Atmosphere on Diamond‐Single‐Grain Scratching of Ti–6Al–4V
Advanced Engineering Materials, EarlyView.Single‐grain scratching of Ti–6Al–4V is investigated under controlled, oxygen‐free, and ambient atmospheres using a novel experimental setup with in situ high‐speed imaging. The approach enables direct observation of chip formation and adhesion under suppressed oxidation.
Berend Denkena +2 more
wiley +1 more source
Characterizing Block Graphs in Terms of their Vertex-Induced Partitions [PDF]
, 2014 Given a finite connected simple graph $G=(V,E)$ with vertex set $V$ and edge set $E\subseteq \binom{V}{2}$, we will show that $1.$ the (necessarily unique) smallest block graph with vertex set $V$ whose edge set contains $E$ is uniquely determined by ...
Dress, A. +4 more
core
Phase Field Failure Modeling: Brittle‐Ductile Dual‐Phase Microstructures under Compressive Loading
Advanced Engineering Materials, EarlyView.The approach by Amor and the approach by Miehe and Zhang for asymmetric damage behavior in the phase field method for fracture are compared regarding their fitness for microcrack‐based failure modeling. The comparison is performed for the case of a dual‐phase microstructure with a brittle and a ductile constituent.
Jakob Huber, Jan Torgersen, Ewald Werner
wiley +1 more source
Advanced Engineering Materials, EarlyView.Scandium (Sc)‐doped AlCoCrFeMo HEA coatings are fabricated via flame spraying with 0.1, 0.3, and 0.5 wt% Sc additions. Among these, the HEA‐Sc0.3 coating exhibits the highest corrosion resistance, indicated by a more positive corrosion potential and lower current density.
Pankaj Kumar +7 more
wiley +1 more source
Vertex partition of hypergraphs and maximum degenerate subhypergraphs
Electronic Journal of Graph Theory and Applications, 2021 In 2007 Matamala proved that if G is a simple graph with maximum degree Δ ≥ 3 not containing KΔ+1 as a subgraph and s, t are positive integers such that s+t ≥ Δ, then the vertex set of G admits a partition (S,T) such that G[S] is a maximum order (s-1 ...
Thomas Schweser, Michael Stiebitz
doaj +1 more source
Spectral Thresholds in the Bipartite Stochastic Block Model [PDF]
, 2016 We consider a bipartite stochastic block model on vertex sets $V_1$ and $V_2$, with planted partitions in each, and ask at what densities efficient algorithms can recover the partition of the smaller vertex set.
Florescu, Laura, Perkins, Will
core +1 more source