Results 21 to 30 of about 85,296 (298)
Decomposition of complete graphs into small graphs [PDF]
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
Teorema Pohon Matriks Untuk Menentukan Banyaknya Pohon Rentangan Graf Bipartisi Komplit (Km,n)
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
Multi-Robot Active Mapping via Neural Bipartite Graph Matching [PDF]
We study the problem of multi-robot active mapping, which aims for complete scene map construction in minimum time steps. The key to this problem lies in the goal position estimation to enable more efficient robot movements.
Kai Ye +7 more
semanticscholar +1 more source
Homomorphisms of infinite bipartite graphs onto complete bipartite graphs [PDF]
Let B be a bipartite graph on the vertex sets C, D. A homomorphism \(\phi\) of B onto a complete bipartite graph \(K_{r,s}\) is said to be bicomplete if \(\phi(x)=\phi(y)\) only if either both x, y belong to C, or both x, y belong to D. For a connected bipartite graph B, the author defines the parameter \(\beta_ 0(B)\) as the supremum of all values of ...
openaire +2 more sources
Bipartite Ramsey numbers involving stars, stripes and trees
The Ramsey number R(m, n) is the smallest integer p such that any blue-red colouring of the edges of the complete graph Kp forces the appearance of a blue Km or a red Kn.
Michalis Christou +2 more
doaj +1 more source
Graceful labeling of triangular extension of complete bipartite graph
For positive integers m , n , K m , n represents the complete bipartite graph. We name the graph G = K m , n ⊙ K 2 as triangular extension of complete bipartite graph K m , n , since there is a triangle hanging from every vertex of K m , n .
Sarbari Mitra, Soumya Bhoumik
semanticscholar +1 more source
Local equivalence of complete bipartite and repeater graph states [PDF]
Classifying locally equivalent graph states, and stabilizer states more broadly, is a significant problem in the theories of quantum information and multipartite entanglement.
I. Tzitrin
semanticscholar +1 more source
Unbalanced bipartite factorizations of complete bipartite graphs [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Universal Rigidity of Complete Bipartite Graphs [PDF]
DCG published ...
Connelly, Robert, Gortler, Steven J.
openaire +2 more sources
Community detection has become a hot topic in complex networks. It plays an important role in information recommendation and public opinion control. Bipartite network, as a special complex network, reflects the characteristics of a kind of network in our
Furong Chang +4 more
doaj +1 more source

