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
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
Partitioning the vertex set of a bipartite graph into complete bipartite subgraphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 Given a graph and a positive integer k, the biclique vertex-partition problem asks whether the vertex set of the graph can be partitioned into at most k bicliques (connected complete bipartite subgraphs).
Oleg Duginov
semanticscholar +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
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
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
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