Results 21 to 30 of about 153,964 (249)
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
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
Some New Results on Lucky Labeling
مجلة بغداد للعلوم, 2023 Czerwi’nski et al. introduced Lucky labeling in 2009 and Akbari et al and A.Nellai Murugan et al studied it further. Czerwi’nski defined Lucky Number of graph as follows: A labeling of vertices of a graph G is called a Lucky labeling if for every pair ...
J. Ashwini +2 more
doaj +1 more source
Rainbow perfect matchings in r-partite graph structures [PDF]
, 2016 A matching M in an edge–colored (hyper)graph is rainbow if each pair of edges in M have distinct colors. We extend the result of Erdos and Spencer on the existence of rainbow perfect matchings in the complete bipartite graph Kn,n to complete bipartite ...
Cano Vila, María del Pilar +2 more
core +2 more sources
Multi-Robot Active Mapping via Neural Bipartite Graph Matching [PDF]
Computer Vision and Pattern Recognition, 2022 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
Two operators on sandpile configurations, the sandpile model on the complete bipartite graph, and a Cyclic Lemma [PDF]
Advances in Applied Mathematics, 2013 We introduce two operators on stable configurations of the sandpile model that provide an algorithmic bijection between recurrent and parking configurations. This bijection preserves their equivalence classes with respect to the sandpile group. The study
J. Aval +3 more
semanticscholar +1 more source
Castelnuovo-Mumford regularity and arithmetic Cohen-Macaulayness of complete bipartite subspace arrangements [PDF]
, 2014 We give the Castelnuovo-Mumford regularity of arrangements of (n-2)-planes in P^n whose incidence graph is a sufficiently large complete bipartite graph, and determine when such arrangements are arithmetically Cohen-Macaulay.Comment: v3: Minor changes ...
A. Torrance +4 more
core +4 more sources
Homomorphisms of infinite bipartite graphs onto complete bipartite graphs [PDF]
Czechoslovak Mathematical Journal, 1983 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
Electronic Journal of Graph Theory and Applications, 2013 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
Electronic Journal of Graph Theory and Applications, 2019 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