Results 41 to 50 of about 143,400 (232)
INTRINSICALLY n-LINKED COMPLETE BIPARTITE GRAPHS [PDF]
Journal of Knot Theory and Its Ramifications, 2008 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.
openaire +3 more sources
On bipartite graphs with complete bipartite star complements
Linear Algebra and its Applications, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
P. Rowlinson
semanticscholar +4 more sources
Decomposition of Random Graphs into Complete Bipartite Graphs [PDF]
SIAM Journal on Discrete Mathematics, 2016 We consider the problem of partitioning the edge set of a graph $G$ into the minimum number $ (G)$ of edge-disjoint complete bipartite subgraphs. We show that for a random graph $G$ in $G(n,p)$, for $p$ is a constant no greater than $1/2$, almost surely $ (G)$ is between $n- c(\ln_{1/p} n)^{3+ }$ and $n - 2\ln_{1/(1-p)} n$ for any positive constants
Chung, Fan, Peng, Xing
openaire +2 more sources
Anti-Ramsey theory on complete bipartite graphs
AKCE International Journal of Graphs and Combinatorics, 2020 We consider quadruples of positive integers with and such that every proper edge-coloring of the complete bipartite graph contains a rainbow subgraph. We show that every such quadruple with and satisfies this property and find an infinite sequence where ...
Stephan Cho +3 more
doaj +1 more source
Resistance between two vertices of almost complete bipartite graphs
Discrete Applied Mathematics, 2019 The resistance between two nodes in some resistor networks has been studied extensively by mathematicians and physicists. Let G ( n , p ) = K n , n − p K 2 ( p ≤ n ) be the almost complete bipartite graph.
Luzhen Ye, Weigen Yan
semanticscholar +1 more source
On multiplicity of quadrilaterals
AKCE International Journal of Graphs and Combinatorics, 2015 Let Kn,n be the complete bipartite graph with n vertices in each partition. We denote M(C4,Kn,n) to be the minimum number of monochromatic copies of quadrilaterals in any 2-edge coloring of Kn,n.
S.S. Rukmani, V. Vijayalakshmi
doaj +1 more source
ABC energies and spectral radii of some graph operations
Frontiers in Physics, 2022 The present article presents some new results relating to Atomic Bond Connectivity energies and Spectral radii of generalized splitting and generalized shadow graphs constructed on the basis of some fundamental families of cycle graph Cn, complete graph ...
Ahmad Bilal, Muhammad Mobeen Munir
doaj +1 more source
Eigensharp graphs: decomposition into complete bipartite subgraphs [PDF]
Transactions of the American Mathematical Society, 1988 Let τ ( G ) \tau (G) be the minimum number of complete bipartite subgraphs needed to partition the edges of G G , and let r ( G ) r(G) be the larger of the number of positive and number of negative eigenvalues of G G . It is
Kratzke, Thomas +2 more
openaire +2 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
Lenz, John, Mubayi, Dhruv
openaire +2 more sources
Complexity of Hamiltonian Cycle Reconfiguration
Algorithms, 2018 The Hamiltonian cycle reconfiguration problem asks, given two Hamiltonian cycles C 0 and C t of a graph G, whether there is a sequence of Hamiltonian cycles C 0 , C 1 , … , C t such that C i can be obtained ...
Asahi Takaoka
doaj +1 more source