Results 41 to 50 of about 41,896 (267)

The Aging Blood: Cellular Origins, Circulating Drivers, and Therapeutic Potential

Aging and Cancer, EarlyView.
As a conduit linking all organs, the blood system both reflects and actively drives systemic aging. This review highlights how circulating pro‐aging and antiaging factors and age‐associated hematopoietic stem cell dysfunction contribute to immunosenescence and multi‐organ decline, positioning the hematopoietic system as a target for aging intervention.
Hanqing He, Jianwei Wang
wiley   +1 more source

Sombor index of thorny graphs

Vojnotehnički Glasnik
Introduction/purpose: The thorny graph of a graph G is obtained by attaching pendent vertices to the vertices of G. A mathematical study of the Sombor index of thorny graphs is undertaken. Methods: Combinatorial graph theory is applied.
Ivan Gutman
doaj   +1 more source

Leap Zagreb Indices of Trees and Unicyclic Graphs

Communications in Combinatorics and Optimization, 2018
By $d(v|G)$ and $d_2(v|G)$ are denoted the number of first and second neighbors‎ ‎of the vertex $v$ of the graph $G$‎. ‎The first‎, ‎second‎, ‎and third leap Zagreb indices‎ ‎of $G$ are defined as‎ ‎$LM_1(G) = \sum_{v \in V(G)} d_2(v|G)^2$‎, ‎$LM_2(G)
I. Gutman, Z. Shao, Z. Li, S.Wang, P. We   +4 more
doaj   +1 more source

Functional Connectivity Linked to Cognitive Recovery After Minor Stroke

Annals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective Patients with minor stroke exhibit slowed processing speed and generalized alterations in functional connectivity involving frontoparietal cortex (FPC). The pattern of connectivity evolves over time. In this study, we examine the relationship of functional connectivity patterns to cognitive performance, to determine ...
Vrishab Commuri, Isabella Dallasta, Ciaran Stone, Sophia Girgenti, Neda Gould, Rafael H. Llinas, Jonathan Z. Simon, Elisabeth Breese Marsh   +7 more
wiley   +1 more source

The Vertex Degree Distances of One Vertex Union of the Cycle and the Star

Journal of Physics: Conference Series, 2022
Abstract The degree distance of a graph is a graph invariant that is more sensitive than the Wiener index. In this paper, we calculate the vertex degree distances of one vertex union of the cycle and the star, and the degree distance of one vertex union of the cycle and the star.
Haiyan Xie, Nini Xue, Jingjing Yang
openaire   +1 more source

Prognostic Implications of Sleep Architecture for Patients Admitted to the Intensive Care Unit With Status Epilepticus

Annals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective Status epilepticus (SE) is associated with significant mortality. Sleep architecture may reflect normal brain function. Impaired sleep architecture is associated with poorer outcomes in numerous conditions. Here we investigate the association of sleep architecture in continuous EEG (cEEG) with survival in SE.
Ran R. Liu, Marcus C. Ng, Gavin P. Winston, Sabrina Schaly, Garima Shukla, Lysa Boissé Lomax   +5 more
wiley   +1 more source

Computing the degree of some matchings in a graph

The American Journal of Combinatorics
Let \(G\) be a connected graph. A matching \(M\) in \(G\) is a set of edges of \(G\) without two of them adjacent (having a common vertex). The graph whose vertices are the matchings in \(G\) and two matchings \(M\) and \(N\) are adjacent if and only if
Rosário Fernandes
doaj   +1 more source

A straightforward edge centrality concept derived from generalizing degree and strength

Scientific Reports, 2022
Vertex degree—the number of edges that are incident to a vertex—is a fundamental concept in network theory. It is the historically first and conceptually simplest centrality concept to rate the importance of a vertex for a network’s structure and ...
Timo Bröhl, Klaus Lehnertz
doaj   +1 more source

ALS With and Without Upper Motor Neuron Signs: A Comparative Study Supporting the Gold Coast Criteria

Annals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective The Gold Coast criteria permit diagnosis of amyotrophic lateral sclerosis (ALS) even without upper motor neuron (UMN) signs. However, whether ALS patients with UMN signs (ALSwUMN) and those without (ALSwoUMN) share similar characteristics and prognoses remains unclear.
Hee‐Jae Jung, E‐nae Cheong, Jungmin So, Heung‐Won Kang, Yangsean Choi, Eun‐Jae Lee, Hyunjin Kim, Young‐Min Lim   +7 more
wiley   +1 more source

Degree resistance distance of unicyclic graphs [PDF]

Transactions on Combinatorics, 2012
Let G be a connected graph with vertex set V(G). The degree resistance distance of G is defined as the sum over all pairs of vertices of the terms [d(u)+d(v)] R(u,v), where d(u) is the degree of vertex u, and R(u,v) denotes the resistance distance ...
Ivan Gutman, Linhua Feng, Guihai Yu
doaj