Results 211 to 220 of about 10,447 (245)
HiGLDP: a hierarchical graph neural network for predicting lncRNA-disease associations through multi-omic integration. [PDF]
BMC BiolWang Y +5 more
europepmc +1 more source
Oriented bipartite graphs and the Goldbach graph [PDF]
Discrete Mathematics, 2021 In this paper, we study oriented bipartite graphs. In particular, we introduce "bitransitive" graphs. Several characterizations of bitransitive bitournaments are obtained. We show that bitransitive bitounaments are equivalent to acyclic bitournaments. As applications, we characterize acyclic bitournaments with Hamiltonian paths, determine number of non-
Shamik Ghosh +2 more
exaly +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Combinatorics, Probability and Computing, 1997
In this note we give a probabilistic proof of the existence of an n-vertex graph Gn, n=1, 2, [ctdot ], such that, for some constant c>0, the edges of Gn cannot be covered by n−c log n complete bipartite subgraphs of Gn. This result improves a previous bound due to F. R. K. Chung and is the best possible up to a constant.
Vojtech Rödl, Andrzej Rucinski 0001
openaire +2 more sources
In this note we give a probabilistic proof of the existence of an n-vertex graph Gn, n=1, 2, [ctdot ], such that, for some constant c>0, the edges of Gn cannot be covered by n−c log n complete bipartite subgraphs of Gn. This result improves a previous bound due to F. R. K. Chung and is the best possible up to a constant.
Vojtech Rödl, Andrzej Rucinski 0001
openaire +2 more sources
A Bipartite Graph That Is Not the $γ$-Graph of a Bipartite Graph
2020For a graph $G = (V, E)$, the $γ$-graph of $G$ is the graph whose vertex set is the collection of minimum dominating sets, or $γ$-sets of $G$, and two $γ$-sets are adjacent if they differ by a single vertex and the two different vertices are adjacent in $G$.
openaire +1 more source
Embeddings of bipartite graphs
Journal of Graph Theory, 1983AbstractIf G is a bipartite graph with bipartition A, B then let Gm,n(A, B) be obtained from G by replacing each vertex a of A by an independent set a1, …, am, each vertex b of B by an independent set b1,…, bn, and each edge ab of G by the complete bipartite graph with edges aibj (1 ≤ i ≤ m and 1 ≤ j ≤ n).
Mohammed Abu-Sbeih, Torrence D. Parsons
openaire +1 more source
On the Nullity of Bipartite Graphs
Graphs and Combinatorics, 2009zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Packing two bipartite graphs into a complete bipartite graph
Journal of Graph Theory, 1997A bipartite graph \(G\) admits an \((a,b)\)-bipartition if \(G\) has a bipartition \((X,Y)\) such that \(|X|=a\) and \(|Y|=b\). Two bipartite graphs \(G\) and \(H\) are compatible if, for some integers \(a\) and \(b\), both \(G\) and \(H\) admit an \((a,b)\)-bipartition. In the paper it is proved that any two compatible \(C_4\)-free bipartite graphs of
openaire +2 more sources
On judicious bipartitions of graphs
Combinatorica, 2016zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jie Ma 0002, Xingxing Yu
openaire +2 more sources
ACM Transactions on Algorithms, 2006
Graph H is a root of graph G if there exists a positive integer k such that x and y are adjacent in G if and only if their distance in H is at most k
openaire +2 more sources
Graph H is a root of graph G if there exists a positive integer k such that x and y are adjacent in G if and only if their distance in H is at most k
openaire +2 more sources
Bipartitions of oriented graphs
Journal of Combinatorial Theory, Series B, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jianfeng Hou, Shufei Wu
openaire +2 more sources