On cliques and bicliques
暂无分享,去创建一个
For integers m, n ≥ 2, let g(m, n) be the minimum order of a graph, where every vertex belongs to both a clique Km of order m and a biclique K(n, n). We show that g(m, n) = 2(m + n - 2) if m ≤ n - 2. Furthermore, for m ≥ n - 1, we establish that $g(m, n) = \lceil (\sqrt{m - 1} + \sqrt{n - 1})^{2}\rceil $ if $\lceil \sqrt{(m - 1)(n - 1)}\rceil$ ≡ 0 mod(n - 1) or, if m is sufficiently large and $\sqrt{(m - 1)(n - 1)}$ is not an integer. © 2000 John Wiley & Sons, Inc. J Graph Theory 34: 60–66, 2000
[1] Wayne Goddard,et al. Homogeneous Embeddings of Cycles in Graphs , 1999, Graphs Comb..
[2] Wayne Goddard,et al. A note on cliques and independent sets , 1997, J. Graph Theory.
[3] Hiren Maharaj,et al. Graph and digraph embedding problems. , 1996 .
[4] Wayne Goddard,et al. WHICH TREES ARE UNIQUELY FRAMED BY THE HEAWOOD GRAPH , 1993 .
[5] Wayne Goddard,et al. SOME GENERAL ASPECTS OF THE FRAMING NUMBER OF A GRAPH , 1993 .