摘要
全文证明了如下结果: 文中B(G)和b(G)分别表示有P(G)个顶点的图G的带宽与和宽,Δ(G)是G的最大度,δ(G)是G的最小度,α=Δ(G^c)—Δ(G)
In this paper, we have proved the following results
Where B(G) and b(G) denote respectively the bandwidth and the sum -width of graph G with order P(G) and, Δ(G) be the maximum degree, of G, δ(G) the mini - mum degree, and
α=Δ(Gc)-Δ(G)
出处
《西北民族学院学报(自然科学版)》
1994年第1期24-27,共4页
Journal of Northwest Minorities University(Natural Science )
关键词
和宽
带宽
补图
度数
图论
Sum - Width Banwidth Complementary Gragh Degree