Results 1 to 10 of about 95,281 (284)
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 +3 more sources
Decomposition of Certain Complete Bipartite Graphs into Prisms
Discussiones Mathematicae Graph Theory, 2017 Häggkvist [6] proved that every 3-regular bipartite graph of order 2n with no component isomorphic to the Heawood graph decomposes the complete bipartite graph K6n,6n.
Froncek Dalibor
doaj +2 more sources
Graceful labeling of triangular extension of complete bipartite graph [PDF]
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
openalex +2 more sources
A Novel Approach for Cyclic Decompositions of Balanced Complete Bipartite Graphs into Infinite Graph Classes [PDF]
Journal of Function Spaces, 2022 Graph theory is considered an attractive field for finding the proof techniques in discrete mathematics. The results of graph theory have applications in many areas of social, computing, and natural sciences.
A. El-Mesady +2 more
doaj +2 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
Interval minors of complete bipartite graphs [PDF]
Journal of Graph Theory, 2014 AbstractInterval minors of bipartite graphs were recently introduced by Jacob Fox in the study of Stanley–Wilf limits. We investigate the maximum number of edges in ‐interval minor‐free bipartite graphs. We determine exact values when and describe the extremal graphs.
Bojan Mohar +3 more
openalex +5 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.
Pietro Caputo +2 more
openalex +3 more sources
Intrinsically n-linked Complete Bipartite Graphs [PDF]
Journal of Knot Theory and Its Ramifications, 2005 We prove that every embedding of K2n+1,2n+1 into ℝ3 contains a non-split link of n components. Further, given an embedding of K2n+1,2n+1 in ℝ3, every edge of K2n+1,2n+1 is contained in a non-split n-component link in K2n+1,2n+1.
Danielle O’Donnol
openalex +5 more sources
Multicolor Ramsey Numbers For Complete Bipartite Versus Complete Graphs [PDF]
Journal of Graph Theory, 2013 AbstractLet be graphs. The multicolor Ramsey number is the minimum integer r such that in every edge‐coloring of by k colors, there is a monochromatic copy of in color i for some . In this paper, we investigate the multicolor Ramsey number , determining the asymptotic behavior up to a polylogarithmic factor for almost all ranges of t and m. Several
John Lenz, Dhruv Mubayi
openalex +4 more sources
Discussiones Mathematicae Graph Theory, 2021 Let G be either a complete graph of odd order or a complete bipartite graph in which each vertex partition has an even number of vertices. In this paper, we determine the set of triples (p, q, r), with p, q, r > 0, for which there exists a decomposition ...
Shyu Tay-Woei
doaj +2 more sources