Results 11 to 20 of about 5,946 (233)
Some New Results on Lucky Labeling
مجلة بغداد للعلوم, 2023 Czerwi’nski et al. introduced Lucky labeling in 2009 and Akbari et al and A.Nellai Murugan et al studied it further. Czerwi’nski defined Lucky Number of graph as follows: A labeling of vertices of a graph G is called a Lucky labeling if for every pair ...
J. Ashwini +2 more
doaj +1 more source
On the Pagenumber of Complete Bipartite Graphs
Journal of Combinatorial Theory, Series B, 1997 An embedding of a simple graph \(G\) into a book is a placing of the vertices of \(G\) along the spine of the book together with a placing of the edges on the pages such that there is no page with crossing edges. The pagenumber \(p(G)\) is the minimum of pages within which \(G\) can be book embedded. Let \(K_{m,n}\) be the complete bipartite graph. The
Hikoe Enomoto +2 more
openaire +1 more source
Interval Minors of Complete Bipartite Graphs [PDF]
Journal of Graph Theory, 2015 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
openaire +3 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 $c$
Fan Chung, Xing Peng
openaire +2 more sources
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
Proportional Choosability of Complete Bipartite Graphs [PDF]
Graphs and Combinatorics, 2020 11 ...
Jeffrey A. Mudrock +3 more
openaire +3 more sources
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
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
Covering a graph by complete bipartite graphs
Discrete Mathematics, 1997 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Paul Erdös, László Pyber
openaire +2 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