Results 31 to 40 of about 153,964 (249)
Algebraic properties of the binomial edge ideal of a complete bipartite graph [PDF]
, 2013 Let JG denote the binomial edge ideal of a connected undirected graph on n vertices. This is the ideal generated by the binomials xiyj − xjyi, 1 ≤ i < j≤ n, in the polynomial ring S = K[x1, . . . , xn, y1, . . . , yn] where {i, j} is an edge of G.
P. Schenzel, Sohail Zafar
semanticscholar +1 more source
Unbalanced bipartite factorizations of complete bipartite graphs [PDF]
Discrete Mathematics, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Universal Rigidity of Complete Bipartite Graphs [PDF]
Discrete & Computational Geometry, 2017 DCG published ...
Connelly, Robert, Gortler, Steven J.
openaire +2 more sources
The Bipartite-Splittance of a Bipartite Graph
Discussiones Mathematicae Graph Theory, 2019 A bipartite-split graph is a bipartite graph whose vertex set can be partitioned into a complete bipartite set and an independent set. The bipartite- splittance of an arbitrary bipartite graph is the minimum number of edges to be added or removed in ...
Yin Jian-Hua, Guan Jing-Xin
doaj +1 more source
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
Bounds for the Kirchhoff Index of Bipartite Graphs
Journal of Applied Mathematics, 2012 A -bipartite graph is a bipartite graph such that one bipartition has m vertices and the other bipartition has n vertices. The tree dumbbell consists of the path together with a independent vertices adjacent to one pendent vertex of and b independent ...
Yujun Yang
doaj +1 more source
Distance energy change of complete bipartite graph due to edge deletion
Linear Algebra and its Applications, 2018 The distance matrix, distance eigenvalue, and distance energy of a connected graph have been studied intensively in the literature. We propose a new problem of studying how the distance energy changes when an edge is deleted. In this paper, we prove that
Anu Varghese, W. So, A. Vijayakumar
semanticscholar +1 more source
Edge condition for hamiltonicity in balanced tripartite graphs [PDF]
Opuscula Mathematica, 2009 A well-known theorem of Entringer and Schmeichel asserts that a balanced bipartite graph of order \(2n\) obtained from the complete balanced bipartite \(K_{n,n}\) by removing at most \(n-2\) edges, is bipancyclic.
Janusz Adamus
doaj +1 more source
Topological Drawings of Complete Bipartite Graphs [PDF]
, 2016 Topological drawings are natural representations of graphs in the plane, where vertices are represented by points, and edges by curves connecting the points. Topological drawings of complete graphs and of complete bipartite graphs have been studied extensively in the context of crossing number problems. We consider a natural class of simple topological
Cardinal, Jean, Felsner, Stefan
openaire +2 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