Results 121 to 130 of about 617,805 (269)
On bipartite tetravalent graphs
Discrete Mathematics, 1974 In this paper the determination of all distance-transitive graphs of valency four is completed.
openaire +2 more sources
On the irregularity of bipartite graphs
Discrete Mathematics, 2007 Let \(G=(V,E)\) be a finite simple graph. For \(u\in V\), let \(d(u)\) denote the valence of \(u\). For any edge \(e=uv\in E\), the imbalance of \(e\) is \(| d(u)-d(v)| \). The irregularity of \(G\), denoted \(\text{{irr}}(G)\), is the sum of the imbalances of the edges of \(G\). These notions are due to \textit{M. O. Albertson} [Ars Comb. 46, 219--225
Michael A. Henning, Dieter Rautenbach
openaire +2 more sources
Drivers of Host–Pathogen Community Assemblages in European Forests and Urban Green Spaces
Integrative Zoology, EarlyView.ABSTRACT Despite advances in understanding infectious diseases, the persistence and re‐emergence of wildlife pathogens continue to raise public and veterinary health concerns. This study investigates the relationship between biodiversity and rodent‐borne diseases in Europe, focusing on habitat alterations and their impact on rodent diversity.
Vincent Sluydts +21 more
wiley +1 more source
Graph Neural Networks for Bipartite Graphs [PDF]
Bipartite graphs are a special type of graph data structure where vertices can be divided into two disjoint and independent sets, and each edge connects a vertex from one set to a vertex in the other set.
Zhang, Xianhang
core +1 more source
Animal Conservation, EarlyView.The potential impact of bat species extinction on the number of their ectoparasitic fly species, based on interaction data for Brazil. As bat host species are removed over time, more connected species (green) would experience steeper declines and lead to greater ectoparasite losses when compared to a random extinction model (gray).
Nathan Lorenzo de Sena Gotti +3 more
wiley +1 more source
Weak saturation numbers of K2 , t and K p ⋃ K q
AKCE International Journal of Graphs and Combinatorics, 2019 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
Predicting lncRNA-protein interactions with bipartite graph embedding and deep graph neural networks. [PDF]
Front Genet, 2023 Ma Y, Zhang H, Jin C, Kang C.
europepmc +1 more source
Discrete Mathematics, 1986 Let \(A_{ij}\) be a binary triangle with base \(a_{1j}\), \(1\leq j\leq n\) such that \(a_{ij}=a_{i-1,j-1}+a_{i-1,j}\) for ...
openaire +3 more sources
Endogenous coalition formation in policy debates
American Journal of Political Science, EarlyView.Abstract Political actors form coalitions around their joint normative beliefs in order to influence the policy process on contentious issues such as climate change or population aging. Policy process theory maintains that learning within and across coalitions is a central predictor of policy change but has yet to explain how policy learning works ...
Philip Leifeld, Laurence Brandenberger
wiley +1 more source
scBGEDA: deep single-cell clustering analysis via a dual denoising autoencoder with bipartite graph ensemble clustering. [PDF]
Bioinformatics, 2023 Wang Y +6 more
europepmc +1 more source