Results 101 to 110 of about 96,628 (243)
This study reveals how forest–grassland edges act as ecological barriers that shape tri‐trophic interaction networks. Using multilayer network theory, it uncovers how species influence and biodiversity patterns emerge across spatial layers, offering novel insights into edge‐driven community assembly and conservation in fire‐prone mosaics.
Henrique Negrello‐Oliveira +2 more
wiley +1 more source
Forced Multi-Agent Bipartite Consensus Control: Application to Quadrotor Formation Flying
This work investigates the multi-agent bipartite consensus problem in the presence of switching antagonistic interactions. For leaderless multi-agent systems communicating over a structurally balanced sign graph with switching antagonistic interactions ...
Jose A. Guerrero +3 more
doaj +1 more source
A multilocus sequence typing approach is proposed to explore Halymorpha halys genetic diversity, taking into consideration both insect nuclear markers and markers from the gut symbiont “Candidatus Pantoa carbekii.” Increased information was revealed regarding the number of distinct holobiont haplotypes in native and invasive populations of the pest ...
Matteo Dho +6 more
wiley +1 more source
Weak saturation numbers of K2 , t and K p ⋃ K q
A graph G is weakly F-saturated if G contains no copy of F, and there is an ordering of all edges of G¯so that if they are added one at a time, they form a complete graph and each edge added creates a new copy of F.
Yajuan Cui, Liqun Pu
doaj +1 more source
Ecological graph theory: Simulating competition and coexistence on graphs
Abstract Since its inception, the evolutionary graph theory (EGT) has been extensively used to study the fixation probability, the rate of evolution, game‐theoretical topics and related questions in a spatially structured framework. However, few attempts have been made to use this framework in ecology.
Ata Kalirad, Ralf J. Sommer
wiley +1 more source
Relations between ordinary energy and energy of a self-loop graph
Let G be a graph on n vertices with vertex set V(G) and let S⊆V(G) with |S|=α. Denote by GS, the graph obtained from G by adding a self-loop at each of the vertices in S.
B.R. Rakshith +3 more
doaj +1 more source
On the diversity of test instances for studying branch‐and‐bound performance
Summary In their paper ‘An Automatic Method for Solving Discrete Programming Problems’, Ailsa Land and Alison Doig developed a branch‐and‐bound method for solving the general case of the mixed integer linear programming (MIP) problem. A core part of the algorithm, branch variable selection, has received renewed attention in recent years with the ...
Simon Bowly, Kate Smith‐Miles
wiley +1 more source
The $z$-matching problem on bipartite graphs
The $z$-matching problem on bipartite graphs is studied with a local algorithm. A $z$-matching ($z \ge 1$) on a bipartite graph is a set of matched edges, in which each vertex of one type is adjacent to at most $1$ matched edge and each vertex of the ...
Zhao, Jin-Hua
core
Adjective‐based qualitative comparative analysis: Relating immobility situations across contexts
Short Abstract This paper introduces an adjective‐based qualitative comparative method for analysing complex lived experiences across diverse contexts. By identifying, harmonising, and relationally comparing salient descriptive adjectives derived from qualitative data, the approach enables structured yet interpretively rich cross‐case comparison ...
Josef Novotný +5 more
wiley +1 more source

