| 关于图的带宽与和宽 |
| |
| 引用本文： | 李新平,焦虹桥.关于图的带宽与和宽[J].西北民族学院学报,1994,15(1):24-27. |
| |
| 作者姓名： | 李新平 焦虹桥 |
| |
| 作者单位： | 甘肃省临洮中学，甘肃省临洮中学 临洮 730050，临洮 730050 |
| |
| 摘 要： | 全文证明了如下结果: 文中B(G)和b(G)分别表示有P(G)个顶点的图G的带宽与和宽,Δ(G)是G的最大度,δ(G)是G的最小度,α=Δ(G~c)—Δ(G)
|
| 关 键 词： | 和宽 带宽 补图 度数 |
On Bandwidth and Sum -Widht of Graph |
| |
| Li XinPing Jiao Hongqiao.On Bandwidth and Sum -Widht of Graph[J].Journal of Northwest Minorities University(Natural Science ),1994,15(1):24-27. |
| |
| Authors: | Li XinPing Jiao Hongqiao |
| |
| Institution: | Li XinPing Jiao Hongqiao |
| |
| Abstract: | 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) |
| |
| Keywords: | Sum - Width Banwidth Complementary Gragh Degree |
| 本文献已被 CNKI 维普 等数据库收录！ |
|
