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 +5 more sources
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
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
Spectral extrema of graphs with fixed size: Cycles and complete bipartite graphs [PDF]
European journal of combinatorics (Print), 2021 Nikiforov (2002) showed that if G is K r + 1 -free then the spectral radius ρ ( G ) ≤ 2 m ( 1 − 1 ∕ r ) , which implies that G contains C 3 if ρ ( G ) > m .
M. Zhai, Huiqiu Lin, Jinlong Shu
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
Cutoff for the averaging process on the hypercube and complete bipartite graphs [PDF]
Electronic Journal of Probability, 2022 We consider the averaging process on a graph, that is the evolution of a mass distribution undergoing repeated averages along the edges of the graph at the arrival times of independent Poisson processes.
P. Caputo +2 more
semanticscholar +1 more source
Quantum walk search on the complete bipartite graph [PDF]
Physical Review A, 2018 The coined quantum walk is a discretization of the Dirac equation of relativistic quantum mechanics, and it is the basis of many quantum algorithms.
Mason L. Rhodes, T. G. Wong
semanticscholar +1 more source
The Extremal Number of the Subdivisions of the Complete Bipartite Graph [PDF]
SIAM Journal on Discrete Mathematics, 2019 For a graph $F$, the $k$-subdivision of $F$, denoted $F^k$, is the graph obtained by replacing the edges of $F$ with internally vertex-disjoint paths of length $k$.
Oliver Janzer
semanticscholar +1 more source