Partitioning the vertex set of a bipartite graph into complete bipartite subgraphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 Graph ...
Oleg Duginov
doaj +2 more sources
Generalized Turán Problems for Complete Bipartite Graphs
Graphs and Combinatorics, 2022 For graphs H, F and integer n, the generalized Turán number ex(n, H, F) denotes the maximum number of copies of H that an F-free n-vertex graph can have. We study this parameter when both H and F are complete bipartite graphs.
Dániel Gerbner, Balázs Patkós
semanticscholar +2 more sources
Narayana Prime Cordial Labeling of Complete Graph and Complete Bipartite Graph
International Journal of Engineering and Advanced Technology, 2019 Complete bipartite graph and complete graph are very important graphs and they find vital applications in the field of computer science. In this paper we compute the labels 0 and 1 to the edges of these graphs by satisfying the cordiality condition using
S. Venkatesh, B. J. Balamurugan
openalex +2 more sources
Orthogonal double cover of Complete Bipartite Graph by disjoint union of complete bipartite graphs
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
Multidecompositions of the Balanced Complete Bipartite Graph into Paths and Stars [PDF]
, 2013 Let and denote a path and a star with edges, respectively. For graphs , , and , a -multidecomposition of is a partition of the edge set of into copies of and copies of with at least one copy of and at least one copy of .
Hung-Chih Lee, Yen-Po Chu
openalex +2 more sources
Counting spanning trees in a complete bipartite graph which contain a given spanning forest [PDF]
Journal of Graph Theory, 2021 In this article, we extend Moon's classic formula for counting spanning trees in complete graphs containing a fixed spanning forest to complete bipartite graphs. Let ( X , Y ) $(X,Y)$ be the bipartition of the complete bipartite graph K m , n ${K}_{m,n}$
F. Dong, Jun Ge
semanticscholar +1 more source
Quantum state transfer on the complete bipartite graph [PDF]
Journal of Physics A: Mathematical and Theoretical, 2021 Previously it was shown that (almost) perfect state transfer can be achieved on the complete bipartite graph by a discrete-time coined quantum walk based algorithm when both the sender and receiver vertices are in the same partition of the graph and when
R. Santos
semanticscholar +1 more source
Packing Colourings in Complete Bipartite Graphs and the Inverse Problem for Correspondence Packing [PDF]
Journal of Graph Theory, 2023 Applications of graph colouring often involve taking restrictions into account, and it is desirable to have multiple (disjoint) solutions. In the optimal case, where there is a partition into disjoint colourings, we speak of a packing.
Stijn Cambie, Rimma Hämäläinen
semanticscholar +1 more source
Packing bipartite graphs with covers of complete bipartite graphs [PDF]
Discrete Applied Mathematics, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chalopin, Jérémie, Paulusma, Daniël
openaire +4 more sources
Parallelogram polyominoes, the sandpile model on a complete bipartite graph, and a
Journal of Combinatorial Theory, 2013 Mark Dukes, Yvan Le Borgne
openalex +2 more sources