Abstract Forty years ago, Kleitman considered the numbers of crossings in good planar drawings of the complete bipartite graph ${K_{m,n}}$. Among other things, he ...
In this paper, we study the spectral radius of bipartite graphs. Let 𝐺 be a bipartite graph with 𝑒 edges without isolated vertices. It was known that the spectral radius of 𝐺 is at most the square ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback