Results 11 to 20 of about 95,281 (284)
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
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
Proportional Choosability of Complete Bipartite Graphs [PDF]
Graphs and Combinatorics, 2020 11 ...
Jeffrey A. Mudrock +3 more
openaire +3 more sources
Complete bipartite graph is a totally irregular total graph
Electronic Journal of Graph Theory and Applications, 2021 A graph G is called a totally irregular total k-graph if it has a totally irregular total k-labeling λ : V ∪ E→ 1, 2, ... , k, that is a total labeling such that for any pair of different vertices x and y of G, their weights wt(x) and wt(y) are distinct,
Meilin I. Tilukay +4 more
doaj +1 more source
On Subgraphs of the Complete Bipartite Graph [PDF]
Canadian mathematical bulletin, 1964 P. Erdös, J. W. Moon
openalex +2 more sources