Results 51 to 60 of about 310,108 (288)
Degree resistance distance of unicyclic graphs [PDF]
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
UiO‐66(Zr) metal–organic frameworks are chemically stable, biocompatible, and highly tunable nanomaterials. Their modular structure enables controlled drug delivery, multimodal bioimaging, and light‐activated photodynamic therapy, supporting integrated diagnostic and therapeutic (theranostic) applications in cancer and biomedical research.
Veronika Huntošová +2 more
wiley +1 more source
Novel Face Index for Benzenoid Hydrocarbons
A novel topological index, the face index ( F I ), is proposed in this paper. For a molecular graph G, face index is defined as F I ( G ) = ∑ f ∈ F ( G ) d ( f ) = ∑ v ∼ f , f ∈ F ( G ) d ( v ...
Muhammad Kamran Jamil +2 more
doaj +1 more source
Limit distributions of vertex degrees in a conditional configuration graph
The configuration graph where vertex degrees are independent identically distributed random variables is often used for modeling of complex networks such as the Internet. We consider a random graph consisting of N vertices. The random variables η1,….,ηN are equal to the degrees of vertices with the numbers 1,… ,N The probability P{ηi=k}, i=1,…, N,
Irina Chepliukova, Yuri Pavlov
openaire +3 more sources
Functional Connectivity Linked to Cognitive Recovery After Minor Stroke
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 +7 more
wiley +1 more source
ORDERING CATACONDENSED HEXAGONAL SYSTEMS WITH RESPECT TO VDB TOPOLOGICAL INDICES
In this paper we give a complete description of the ordering relations in the set of catacondensed hexagonal systems, with respect to a vertex-degree-based topological index. As a consequence, extremal values of vertex-degree-based topological indices in
Juan Rada
doaj +1 more source
On the degree evolution of a fixed vertex in some growing networks [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lindholm, Mathias, Vallier, Thomas
openaire +2 more sources
Spanning trees in graphs of high minimum degree with a universal vertex II: A tight result
AbstractWe prove that, if is sufficiently large, every graph on vertices that has a universal vertex and minimum degree at least contains each tree with edges as a subgraph. Our result confirms, for large , an important special case of a conjecture by Havet, Reed, Stein, and Wood.
Bruce Reed, Maya Stein
openaire +3 more sources
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 +5 more
wiley +1 more source
Random graphs with arbitrary degree distributions and their applications
Recent work on the structure of social networks and the internet has focussed attention on graphs with distributions of vertex degree that are significantly different from the Poisson degree distributions that have been widely studied in the past.
A. Broder +46 more
core +1 more source

