Results 51 to 60 of about 213,970 (327)
Diameter and Treewidth in Minor-Closed Graph Families
It is known that any planar graph with diameter D has treewidth O(D), and this fact has been used as the basis for several planar graph algorithms. We investigate the extent to which similar relations hold in other graph families.
Eppstein, David
core +2 more sources
ABSTRACT Objective To delineate specific in vivo white matter pathology in neuronal intranuclear inclusion disease (NIID) using diffusion spectrum imaging (DSI) and define its clinical relevance. Methods DSI was performed on 42 NIID patients and 38 matched controls.
Kaiyan Jiang +10 more
wiley +1 more source
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
This study investigates laser shock peening for enhancing fatigue performance of riveted aerospace aluminum joints. A comparative approach with cold expansion combines fatigue testing and synchrotron X‐ray methods. Integrating mechanical testing with residual stress and strain characterization provides insights into how different treatments affect the ...
Ogün Baris Tapar +6 more
wiley +1 more source
An idea of designing novel sensors is proposed by creating appropriate Schottky barriers and vacancies between isomorphous Core‐CuOii/ Shell‐CuOi secondary microspheres and enhancing catalytic and spill‐over effects, and electronegativity via spontaneous biphasic separation, self‐assembly, and trace‐Ni‐doping.
Bala Ismail Adamu +8 more
wiley +1 more source
AbstractAn F-planar graph, where F is an ordered field, is a graph that can be represented in the plane F × F, with non-crossing line segments as edges. It is shown that the graph G is F-planar for some F if and only if every finite subgraph of G is planar.
openaire +2 more sources
A Workflow to Accelerate Microstructure‐Sensitive Fatigue Life Predictions
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 wood‐based magnetic and conductive material called Magwood (MW), capable of blocking almost 99.99% of electromagnetic waves (in the X‐band frequency range), is synthesized using a simple, solvent‐free process. MW is lightweight, resists water, and is flame‐retardant, making it a promising alternative for shielding electronics. The rapid proliferation
Akash Madhav Gondaliya +3 more
wiley +1 more source
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
On (p, 1)-Total Labelling of Some 1-Planar Graphs
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

