Results 231 to 240 of about 617,805 (269)
Prodeg type Shannon graph entropies with closed forms bounds and QSPR modeling. [PDF]
Sci RepAlsharafi M, Zeren Y.
europepmc +1 more source
lncAPNet enables the deciphering of lncRNA-mRNA connections in patient transcriptomic data. [PDF]
Bioinform AdvVasileiou V +8 more
europepmc +1 more source
PAIR: Reconstructing Single-Cell Open-Chromatin Landscapes for Transcription Factor Regulome Mapping. [PDF]
Adv Sci (Weinh)Su Y +7 more
europepmc +1 more source
Topological Engineering of Chiral Anomalies in Janus Nanoribbons. [PDF]
Nano LettSaroka VA, Demin VA, Pizzochero M.
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, Shamik Ghosh, Sandip Das
exaly +3 more sources
Linear structure of bipartite permutation graphs and the longest path problem [PDF]
Information Processing Letters, 2007 The class of bipartite permutation graphs is the intersection of two well known graph classes: bipartite graphs and permutation graphs. A complete bipartite decomposition of a bipartite permutation graph is proposed in this note.
Gabriel Valiente, Ryuhei Uehara
exaly +2 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
Bipartite graphs as polynomials and polynomials as bipartite graphs
Journal of Algebra and Its Applications, 2020The aim of this paper is to show that any finite undirected bipartite graph can be considered as a polynomial [Formula: see text], and any directed finite bipartite graph can be considered as a polynomial [Formula: see text], and vise verse. We also show that the multiplication in the semirings [Formula: see text], [Formula: see text] corresponds to an
Grinblat, Andrey, Lopatkin, Viktor
openaire +2 more sources
On the Nullity of Bipartite Graphs
Graphs and Combinatorics, 2009zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources