Results 91 to 100 of about 1,430 (216)
Reserves, Injury Severity, and Outcomes in Traumatic Brain Injury: A CENTER‐TBI Observational Study
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective Reserve refers to the brain's ability to maintain function after an injury and strongly relates to traumatic brain injury (TBI) outcomes. This study examined (1) whether associations between pre‐injury reserve proxies and outcomes differed across injury severity categories, and (2) whether the impact of injury severity varied across ...
Natascha Ekdahl +6 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
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, 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
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
AUTOMORPHISMS OF DISTANCE-REGULAR GRAPH WITH INTERSECTION ARRAY {39; 36; 4; 1; 1; 36}
Ural Mathematical Journal, 2018 Makhnev and Nirova have found intersection arrays of distance-regular graphs with no more than \(4096\) vertices, in which \(\lambda=2\) and \(\mu=1\). They proposed the program of investigation of distance-regular graphs with \(\lambda=2\) and \(\mu=1\)
Konstantin S. Efimov +1 more
doaj +1 more source
Discrete Mathematics, 1982 AbstractThe boolean distance between two points x and y of a connected graph G is defined as the set of all points on all paths joining x and y in G (Ø if x = y). It is determined in terms of the block-cutpoint graph of G, and shown to satisfy the triangle inequality b(x,y)⊆ b(x, z)∪b(z,y). We denote by B(G) the collection of distinct boolean distances
Frank Harary +3 more
openaire +4 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
Advanced Engineering Materials, EarlyView.This study examines how helicoidal architectures with different porosities respond to bending. Adjusting layer angle and spacing in 3D‐printed polymers reveals clear tradeoffs between stiffness, strength, and energy absorption. Experiments and simulations highlight designs that distribute stress effectively, offering pathways for optimizing lightweight
Praveenkumar Subhash Patil +2 more
wiley +1 more source
Distance spectrum of Indu–Bala product of graphs
AKCE International Journal of Graphs and Combinatorics, 2016 The D-eigenvalues μ1,μ2,…,μn of a graph G of order n are the eigenvalues of its distance matrix D and form the distance spectrum or D-spectrum of G denoted by SpecD(G). Let G1 and G2 be two regular graphs. The Indu–Bala product of G1 and G2 is denoted by
G. Indulal, R. Balakrishnan
doaj +1 more source