Results 131 to 140 of about 2,449,773 (154)

Comparing the ability of embedding methods on metabolic hypergraphs for capturing taxonomy-based features. [PDF]

Algorithms Mol Biol
Cervellini M, Sinaimeri B, Matias C, Martino A.   +3 more
europepmc   +1 more source

Evolution of genomic architecture of the plant-pathogenic fungus <i>Alternaria</i> revealed by comparative analyses of 12 chromosome-level assemblies. [PDF]

Microb Genom
Dettman JR, Kim NE, Dadej K.
europepmc   +1 more source

Hidden Structure of Care Coordination in Heart Failure Care Transitions: A Mixed-Method Network Analysis of Clinical Notes. [PDF]

J Card Fail
Wei S, McConnell ES, Corazzini KN, Moody J, Pan W, Linder JA, Granger BB.   +6 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Diameter Three Orientability of Mixed Bipartite Graphs

Graphs and Combinatorics
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jianbing Liu, An Chang
exaly   +4 more sources

Maximal Energy Bipartite Graphs

Graphs and Combinatorics, 2003
Given a graph $G$, its energy $E(G)$ is defined to be the sum of the absolute values of the eigenvalues of $G$. This quantity is used in chemistry to approximate the total $\pi$-electron energy of molecules and in particular, in case $G$ is bipartite ...
Vincent Moulton, Jack H. Koolen
exaly   +2 more sources

A Mixed Approximation Algorithm for Matching Preclusion Number in Bipartite Graphs

International Conference on Computer Application and Information Security (ICCAIS 2024)
Zhibin Chen
exaly   +2 more sources

Signed mixed dominating functions in complete bipartite graphs

International Journal of Computer Mathematics, 2014
Let G=(V, E) be a simple graph with vertex set V and edge set E. A signed mixed dominating function (SMDF) of G is a function f: V∪E→{−1, 1} such that for every element x∈V∪E, where Nm(x) is the set, called mixed neighbourhood of x, of elements of V∪E adjacent or incident to x.
Erfang Shan, Yancai Zhao
openaire   +1 more source

Mixing patterns and communities on bipartite graphs on web-based social interactions

2009 16th International Conference on Digital Signal Processing, 2009
We use bipartite graph representation of interactions between users of Web databases, such as data about art subjects (books, movies, music records), where users interact via posting comments related to a specific subject. We study patterns of clustering which emerge through the common interests of users.
Grujic, Jelena, Mitrovic, Marija, Tadic, Bosiljka   +2 more
openaire   +2 more sources

Mixed-cycle-V-super magic decomposition of complete bipartite graphs

Asian-European Journal of Mathematics
An [Formula: see text]-magic labeling in an [Formula: see text]-decomposable graph [Formula: see text] is a bijection [Formula: see text] such that for every copy [Formula: see text] in the decomposition, [Formula: see text] is constant. [Formula: see text] is said to be [Formula: see text]-[Formula: see text]-super magic if [Formula: see text].
S. Stalin Kumar, G. Marimuthu
openaire   +1 more source