Results 31 to 40 of about 3,103 (144)
Journal of Animal Ecology, Volume 94, Issue 12, Page 2403-2420, December 2025.Beavers reshape ecosystems in ways that benefit bat richness, activity and feeding activity. We linked increased habitat structures (standing deadwood and canopy heterogeneity) and prey abundance to higher bat activity. Our findings uncover how beavers drive biodiversity across aquatic‐terrestrial boundaries.
Valentin Moser +10 more
wiley +1 more source
, 2004 The connections in many networks are not merely binary entities, either present or not, but have associated weights that record their strengths relative to one another.
A. Capocci +10 more
core +1 more source
Graphs that do not contain a cycle with a node that has at least two neighbors on it [PDF]
, 2012 We recall several known results about minimally 2-connected graphs, and show that they all follow from a decomposition theorem. Starting from an analogy with critically 2-connected graphs, we give structural characterizations of the classes of graphs ...
Aboulker, Pierre +3 more
core +3 more sources
Processes, 2023 The D reservoir in the Bongor Basin, southern Chad, is highly heterogeneous. In the stage of waterflood development, the injected water is seriously channeled along the dominant channel, and the water drive effect becomes worse.
Yuhui Zhou +4 more
semanticscholar +1 more source
Quantifying the Influence of Poly(Ethylene glycol) on the Micelle Formation of Nonionic Detergents
ChemPlusChem, Volume 90, Issue 10, October 9, 2025.The influence of poly(ethylene glycols) (PEG) with different molecular weights on the critical micelle concentration of nonionic detergents is quantified based on fluorescence spectra of 8‐anilinonaphthalene‐1‐sulfonate (ANS) and found to depend on the concentration of oxyethylene (OE) units rather than polymer length.
Frank Müh, Julia Gätcke, Athina Zouni
wiley +1 more source
Longest cycles in vertex‐transitive and highly connected graphs
Bulletin of the London Mathematical Society, Volume 57, Issue 10, Page 2975-2990, October 2025.Abstract We present progress on three old conjectures about longest paths and cycles in graphs. The first pair of conjectures, due to Lovász from 1969 and Thomassen from 1978, respectively, states that all connected vertex‐transitive graphs contain a Hamiltonian path, and that all sufficiently large such graphs even contain a Hamiltonian cycle.
Carla Groenland +4 more
wiley +1 more source
The generalized 3-edge-connectivity of lexicographic product graphs
, 2014 The generalized $k$-edge-connectivity $\lambda_k(G)$ of a graph $G$ is a generalization of the concept of edge-connectivity. The lexicographic product of two graphs $G$ and $H$, denoted by $G\circ H$, is an important graph product.
B Barden +28 more
core +1 more source
Social network analysis in social psychological ressearch (1990–2020): A scoping review
British Journal of Social Psychology, Volume 64, Issue 1, January 2025.Abstract Over the last two decades, Social Network Analysis (SNA) has become a standard tool in various social science disciplines. In social psychology, however, the use of SNA methodology remains scarce. This research identifies gaps in SNA use in Social Psychology and offers pathways for its further development. It reviews all empirical papers using
Anahita Mehrpour +2 more
wiley +1 more source
The Restricted Edge-Connectivity of Strong Product Graphs [PDF]
AxiomsThe restricted edge-connectivity of a connected graph G, denoted by λ′(G), if it exists, is the minimum cardinality of a set of edges whose deletion makes G disconnected, and each component has at least two vertices.
Hazhe Ye, Yingzhi Tian
semanticscholar +1 more source
The Lovász–Cherkassky theorem in infinite graphs
Transactions of the London Mathematical Society, Volume 11, Issue 1, December 2024.Abstract Infinite generalizations of theorems in finite combinatorics were initiated by Erdős due to his famous Erdős–Menger conjecture (now known as the Aharoni–Berger theorem) that extends Menger's theorem to infinite graphs in a structural way. We prove a generalization of this manner of the classical result about packing edge‐disjoint T$ T$‐paths ...
Attila Joó
wiley +1 more source