Results 31 to 40 of about 96,628 (243)
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
Discrete Mathematics, 1993 This paper deals with bithreshold graphs and their characterization. After having given some necessary properties the authors succeed in proving a complete characterization of the class of bipartite bithreshold graphs by means of 11 not bithreshold (so-called forbidden induced subgraphs) and 5 classes of induced subgraphs.
Uri N. Peled +2 more
openaire +2 more sources
Decomposition of complete graphs into small graphs [PDF]
Opuscula Mathematica, 2010 In 1967, A. Rosa proved that if a bipartite graph \(G\) with \(n\) edges has an \(\alpha\)-labeling, then for any positive integer \(p\) the complete graph \(K_{2np+1}\) can be cyclically decomposed into copies of \(G\).
Dalibor Froncek
doaj +1 more source
BIPARTITE GRAPH ASSOCIATED WITH ELEMENTS AND COSETS OF SUBRINGS OF FINITE RINGS
Barekeng, 2023 Let be a finite ring. The bipartite graph associated to elements and cosets of subrings of is a simple undirected graph with vertex set , where is the set of all subrings of , and two vertices and are adjacent if and only if In this study, we ...
Hubbi Muhammad +3 more
doaj +1 more source
Bipartite biregular Moore graphs [PDF]
Discrete Mathematics, 2021 19 pages, 2 ...
Araujo-Pardo, G. +3 more
openaire +5 more sources
Detecting and generating overlapping nested communities
Applied Network Science, 2023 Nestedness has been observed in a variety of networks but has been primarily viewed in the context of bipartite networks. Numerous metrics quantify nestedness and some clustering methods identify fully nested parts of graphs, but all with similar ...
Imre Gera, András London
doaj +1 more source
Dynamic Load Balancing Algorithm Based on Optimal Matching of Weighted Bipartite Graph
IEEE Access, 2022 When the server cluster is processing concurrent task requests, if the performance difference among servers is not fully considered, task allocation will be unreasonable, which will lead to an increase in task making span and a decrease in cluster ...
Wei Hou +3 more
doaj +1 more source
Bipartite powers of k-chordal graphs [PDF]
, 2012 Let k be an integer and k \geq 3. A graph G is k-chordal if G does not have an induced cycle of length greater than k. From the definition it is clear that 3-chordal graphs are precisely the class of chordal graphs. Duchet proved that, for every positive
Chandran, L. Sunil, Mathew, Rogers
core +2 more sources
Antifactors of regular bipartite graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 Let $G=(X,Y;E)$ be a bipartite graph, where $X$ and $Y$ are color classes and $E$ is the set of edges of $G$. Lov\'asz and Plummer \cite{LoPl86} asked whether one can decide in polynomial time that a given bipartite graph $G=(X,Y; E)$ admits a 1-anti ...
Hongliang Lu, Wei Wang, Juan Yan
doaj +1 more source
Discrete Mathematics, 1997 Consider two bipartite graphs \(G=\{L,R,E\}\) and \(G'=\{L',R',E'\}\). A bijection \(f:L\cup R\to L'\cup R'\) such that \(f(L)=L'\) and \(f(u)f(v)\not\in E'\) for every edge \(uv\in E\) is called a bi-placement of \(G\) and \(G'\). The graphs \(G\) and \(G'\) are called bi-placeable if there exists a bi-placement of \(G\) and \(G'\).
Paul Vaderlind, A. Paweł Wojda
openaire +2 more sources