Results 51 to 60 of about 783,181 (348)

Arterial Spin‐Labeling MRI at the Cortical‐CSF Interface: A Novel Biomarker in Alzheimer Disease

Annals of Clinical and Translational Neurology, EarlyView.
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, Pouya Metanat, Michael Thomas, Luke W. Bonham, Tyson Lam, Mehmet Kurt, Hong Nguyen, Tara Ellingson, Mauro Zucchelli, Stefano Casagranda, Quin Lu, Andreas M. Rauschecker, Leo Sugrue, Luis E. Savastano, Christopher P. Hess, Kamalini Ranasinghe, S. Andrew Josephson, Bruce L. Miller, Jennifer S. Yokoyama, Gil D. Rabinovici, Peter A. Ljubenkov, Lawren VandeVrede, Kambiz Nael   +22 more
wiley   +1 more source

The Hadwiger number, chordal graphs and -perfection

AKCE International Journal of Graphs and Combinatorics, 2017
A graph is chordal if every induced cycle has three vertices. The Hadwiger number is the order of the largest complete minor of a graph. We characterize the chordal graphs in terms of the Hadwiger number and we also characterize the families of graphs ...
Christian Rubio-Montiel
doaj   +1 more source

β-Perfect Graphs [PDF]

, 1996
The class ofβ-perfect graphs is introduced. We draw a number of parallels between these graphs and perfect graphs. We also introduce some special classes ofβ-perfect graphs. Finally, we show that the greedy algorithm can be used to colour a graphGwith no
Markossian, S.E., Gasparian, G.S., Reed, B.A.   +2 more
core   +1 more source

Perfection thickness of graphs

Discrete Mathematics, 2000
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, Tao Jiang 0003, André Kündgen, Douglas B. West   +3 more
openaire   +2 more sources

Nearly perfect sets in products of graphs [PDF]

Opuscula Mathematica, 2004
The study of nearly perfect sets in graphs was initiated in [Dunbar J. E., Harris F. C., Hedetniemi S. M., Hedetniemi S. T., McRae A. A., Laskar R. C.: Nearly perfect sets in graphs. Discrete Mathematics 138 (1995), 229-246]. Let \(S\subseteq V(G)\).
Maria Kwaśnik, Monika Perl
doaj  

Mapping the Social Network Structure and Composition of Black Individuals With Rheumatic and Musculoskeletal Conditions

Arthritis Care &Research, EarlyView.
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, Amar Dhand, Leah Santacroce, Neil Pillai, Komel Safdar, Mia T. Chandler, Ariel Childs, Monica Crespo‐Bosque, Gina Curry, Mary Dollear, Alice Eggleston, Daniel Erickson, Dieufort Fleurissaint, Denice Garrett, Gail Granville, Tyler Green, Magdalena Hamielec, Elena Losina, Karen Mancera‐Cuevas, Mary Ann Nelson, Chisa Nosamiefan, Bisola Ojikutu, Tonya S. Roberson, Mary Beth Son, Marie Jacques Toussaint, Michael York, Rosalind Ramsey‐Goldman, Candace H. Feldman   +27 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, Krzysztof S. Stopka, Michael D. Sangid   +2 more
wiley   +1 more source

Perfect secure domination in graphs [PDF]

Categories and General Algebraic Structures with Applications, 2017
Let $G=(V,E)$ be a graph. A subset $S$ of $V$ is a dominating set of $G$ if every vertex in $Vsetminus  S$ is adjacent to a vertex in $S.$ A dominating set $S$ is called a secure dominating set if for each $vin Vsetminus S$ there exists $uin S$ such that
S.V. Divya Rashmi, Subramanian Arumugam, Kiran R. Bhutani, Peter Gartland   +3 more
doaj  

On the number of perfect matchings in random polygonal chains

Open Mathematics, 2023
Let GG be a graph. A perfect matching of GG is a regular spanning subgraph of degree one. Enumeration of perfect matchings of a (molecule) graph is interest in chemistry, physics, and mathematics.
Wei Shouliu, Feng Yongde, Ke Xiaoling, Huang Jianwu   +3 more
doaj   +1 more source

A Numerical–Experimental Approach for Multi‐Matrix Fiber‐Reinforced Plastics Characterization Using Finite Element Model Updating

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, Tales V. Lisbôa, Axel Spickenheuer, Rogério J. Marczak, Jakson M. Vassoler   +4 more
wiley   +1 more source