Results 61 to 70 of about 973,826 (351)
Perfection thickness of graphs
For a graph \(G\), let \(f(G)\) be the least number of perfect subgraphs of \(G\) whose union is \(G\). Let \(f(n)= \max\{f(G):|V(G)|= n\}\). Improving results of Zs. Tuza, the authors prove that \[ \textstyle{{1\over 2}}(\log n-\log\log n- O(1))\leq f(n)\leq \lceil\log n\rceil, \] where \(\log\) denotes the base-2 logarithm.
Hirotsugu Asari +3 more
openaire +2 more sources
Arterial Spin‐Labeling MRI at the Cortical‐CSF Interface: A Novel Biomarker in Alzheimer Disease
ABSTRACT Background/Objective Arterial spin‐labeling (ASL) MRI can measure perfusion signal adjacent to CSF spaces and may provide information regarding CSF‐adjacent water transport physiology. We developed an automated pipeline to extract cortical‐CSF interface (IF) perfusion for comparison between Alzheimer disease (AD) and cognitively normal ...
Mona Asghariahmadabad +22 more
wiley +1 more source
Objective Our objective was to describe the social networks of Black individuals with rheumatic and musculoskeletal conditions and understand the clustering of health‐related behaviors to inform future community‐based, peer‐led interventions. Methods We used an adapted Personal Network Survey for Clinical Research (PERSNET) to map the personal social ...
Taussia Boadi +27 more
wiley +1 more source
Critical perfect graphs and perfect 3-chromatic graphs
AbstractThis paper builds on results based on D. R. Fulkerson's antiblocking polyhedra approach to perfect graphs to obtain information about critical perfect graphs and related clique-generated graphs. Then we prove that Berge's Strong Perfect Graph Conjecture is valid for 3-chromatic graphs.
openaire +3 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 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
On expansive and anti-expansive tree maps [PDF]
With every self-map on the vertex set of a finite tree one can associate the directed graph of a special type which is called the Markov graph. Expansive and anti-expansive tree maps are two extremal classes of maps with respect to the number of loops in
Sergiy Kozerenko
doaj +1 more source
Independent sets of maximum weight in apple-free graphs [PDF]
We present the first polynomial-time algorithm to solve the maximum weight independent set problem for apple-free graphs, which is a common generalization of several important classes where the problem can be solved efficiently, such as claw-free graphs,
Lozin, Vadim V. +2 more
core +1 more source
Building machine‐readable vocabularies for materials science is slow, expert‐driven work. This study benchmarks 13 large language models on two of its first steps: finding candidate terms in engineering articles and deciding where they belong in a class hierarchy.
Thomas Bjarsch +3 more
wiley +1 more source
k-perfect geodominating sets in graphs [PDF]
A perfect geodominating set in a graph \(G\) is a geodominating set \(S\) such that any vertex \(v \in V(G)\setminus S\) is geodominated by exactly one pair of vertices of \(S\).
Doost Ali Mojdeh, Nader Jafari Rad
doaj

