Results 11 to 20 of about 2,876,957 (249)
Orthogonal double cover of Complete Bipartite Graph by disjoint union of complete bipartite graphs [PDF]
Ain Shams Engineering Journal, 2015 Let H be a graph on n vertices and G a collection of n subgraphs of H, one for each vertex, G is an orthogonal double cover (ODC) of H if every edge of H occurs in exactly two members of G and any two members share an edge whenever the corresponding ...
S. El-Serafi +2 more
doaj +2 more sources
The Bipartite-Splittance of a Bipartite Graph [PDF]
Discussiones Mathematicae Graph Theory, 2019 A bipartite-split graph is a bipartite graph whose vertex set can be partitioned into a complete bipartite set and an independent set. The bipartite- splittance of an arbitrary bipartite graph is the minimum number of edges to be added or removed in ...
Yin Jian-Hua, Guan Jing-Xin
doaj +3 more sources
Covering a graph by complete bipartite graphs [PDF]
Discrete Mathematics, 1997 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Paul Erdös, László Pyber
openaire +3 more sources
On Orthogonal Double Covers and Decompositions of Complete Bipartite Graphs by Caterpillar Graphs
Algorithms, 2023 Nowadays, graph theory is one of the most exciting fields of mathematics due to the tremendous developments in modern technology, where it is used in many important applications.
Ahmed El-Mesady +3 more
doaj +2 more sources
Small bipartite subgraph polytopes [PDF]
, 2010 We compute a complete linear description of the bipartite subgraph polytope, for up to seven nodes, and a conjectured complete description for eight nodes.
Galli, L, Letchford, A N
core +5 more sources
Packing four copies of a tree into a complete bipartite graph [PDF]
, 2022 summary:In considering packing three copies of a tree into a complete bipartite graph, H. Wang (2009) gives a conjecture: For each tree $T$ of order $n$ and each integer $k\geq 2$, there is a $k$-packing of $T$ in a complete bipartite graph $B_{n+k-1 ...
Pu, Liqun, Gao, Xiaoli, Tang, Yuan
core +1 more source
MAPA: A Semantic Network Framework for Functional Module Discovery and Interpretation in Multi-Omics Data. [PDF]
Adv Sci (Weinh)MAPA transforms complex multi‐omics data into biologically coherent functional modules by integrating pathway information with molecular interaction networks. Retrieval‐augmented large language models then generate structured, literature‐informed interpretations.
Ge Y +13 more
europepmc +2 more sources
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 +2 more sources
Teorema Pohon Matriks Untuk Menentukan Banyaknya Pohon Rentangan Graf Bipartisi Komplit (Km,n)
Fokus, 2016 This research aims to observes panning tree number of complete bipartite graph (Km,n) by matrix-tree theorem.This research was using library research method which the step are:(1)Drawing complete bipartite graph (Km,n) where m= 1,2,3,4,and; (2)Determinin
Novia Rahmawati
doaj +1 more source
Decomposition of complete graphs into small graphs [PDF]
Opuscula Mathematica, 2010 In 1967, A. Rosa proved that if a bipartite graph \(G\) with \(n\) edges has an \(\alpha\)-labeling, then for any positive integer \(p\) the complete graph \(K_{2np+1}\) can be cyclically decomposed into copies of \(G\).
Dalibor Froncek
doaj +1 more source