Results 21 to 30 of about 140,780 (247)
Generalized Turán Problems for Complete Bipartite Graphs
Graphs and Combinatorics, 2022 For graphs H, F and integer n, the generalized Turán number ex(n, H, F) denotes the maximum number of copies of H that an F-free n-vertex graph can have. We study this parameter when both H and F are complete bipartite graphs.
Dániel Gerbner, Balázs Patkós
semanticscholar +1 more source
Graceful labeling of triangular extension of complete bipartite graph
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
semanticscholar +1 more source
Bipartite Ramsey numbers involving stars, stripes and trees
Electronic Journal of Graph Theory and Applications, 2013 The Ramsey number R(m, n) is the smallest integer p such that any blue-red colouring of the edges of the complete graph Kp forces the appearance of a blue Km or a red Kn.
Michalis Christou +2 more
doaj +1 more source
Local equivalence of complete bipartite and repeater graph states [PDF]
Physical Review A, 2018 Classifying locally equivalent graph states, and stabilizer states more broadly, is a significant problem in the theories of quantum information and multipartite entanglement.
I. Tzitrin
semanticscholar +1 more source
IEEE Access, 2019 Community detection has become a hot topic in complex networks. It plays an important role in information recommendation and public opinion control. Bipartite network, as a special complex network, reflects the characteristics of a kind of network in our
Furong Chang +4 more
doaj +1 more source
On the r-dynamic coloring of subdivision-edge coronas of a path
AIMS Mathematics, 2020 This paper deals with the r-dynamic chromatic number of the subdivision-edge corona of a path and exactly one of the following nine types of graphs: a path, a cycle, a wheel, a complete graph, a complete bipartite graph, a star, a double star, a fan ...
G. Nandini +2 more
doaj +1 more source
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
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
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
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