Results 71 to 80 of about 1,075 (167)
Journal of Sleep Research, Volume 35, Issue 4, August 2026.ABSTRACT Preterm birth is a significant risk factor for atypical neurodevelopment, yet early electrophysiological markers of brain maturation are still lacking. Non‐invasive electroencephalographic (EEG) monitoring of cortical maturation in these patients holds promise as a tool for neurodevelopmental prediction.
Gaia Burlando +9 more
wiley +1 more source
Exploring the Distance-Based Topological Indices for Total Graphs via Numerical Comparison
Journal of MathematicsGraph theory serves as a valuable tool across numerous scientific disciplines, offering the means to model and analyze intricate networks. In this study, we explore the application of distance-based topological indices to a variety of graphs, including ...
Haseeb Ahmad +3 more
doaj +1 more source
Channeling Action: How Civic Recreation Organizations Shape Civic Capacity and Engagement
Politics &Policy, Volume 54, Issue 4, August 2026.ABSTRACT In this paper, we examine the individual‐level and organizational‐level implications of participation in a particular type of civic association—a civic recreation organization. We deploy a small‐n comparison group design, comparing data within and across members of a civic recreation organization with varying degrees of involvement to ...
Emma Scheetz, David Carter
wiley +1 more source
Journal of Applied MathematicsAmong the diverse types of graph products, the double join and double corona operations have remained central to many recent developments in graph theory, offering fresh insights and problem-solving strategies. Subdivision graphs, in particular, serve as
M. Vimal +2 more
doaj +1 more source
How to see the forest despite the trees
Journal of the London Mathematical Society, Volume 114, Issue 2, August 2026.Abstract One of the major starting points of discrete optimization is the theorem of Nash‐Williams and Tutte on the existence of k$k$ disjoint spanning trees of a graph, along with its counterpart on the existence of k$k$ forests covering all edges of the graph.
Erika Bérczi‐Kovács, András Frank
wiley +1 more source
Croatica Chemica Acta, 2004 If two edges e and f are deleted from a tree T, then it decomposes into three components, possessing, n0(e, f ), n1(e, f ), and n2(e, f ) vertices. Let n0(e, f ) count the vertices lying between the edges e and f. It is shown that the Wiener index W of the tree T is equal to the sum over all edges e of the products n1(e, e) • n2(e, e), and that the ...
openaire +2 more sources
Wiener Index, Hyper-wiener Index, Harary Index and Hamiltonicity of graphs
, 2018 In this paper, we discuss the Hamiltonicity of graphs in terms of Wiener index, hyper-Wiener index and Harary index of their quasi-complement or complement. Firstly, we give some sufficient conditions for an balanced bipartite graph with given the minimum degree to be traceable and Hamiltonian, respectively.
Yu, Guidong, Ren, Lifang, Cai, Gaixiang
openaire +2 more sources
The structure of graphs with extremal hyper-Wiener index
FilomatThe hyper-Wiener index of a graph G is defined as WW(G) = 1/2 ?{u,v}?V(G) (d2G(u,v)+dG(u,v)), where dG(u,v) denotes the distance between u and v in G. In this paper, we determine the maximum hyper-Wiener index of 2-connected graphs and 2-edge-connected graphs, which extends the result of Plesnik [On the sum of all distances in a graph or digraph, J ...
Hechao Liu, Lihua You, Yufei Huang
openaire +1 more source
On distance-based topological indices and co-indices of fractal-type molecular graphs and their respective graph entropies. [PDF]
PLoS One, 2023 Malik MA, Imran M, Adeel M.
europepmc +1 more source