|
|||||
|
|
| THE CONSTRUCTION OF 133-CUBIC GRAPHS | |
| 作者姓名： | 周明琨 |
| 作者单位： | Xin jiang |
| 摘 要： | We present a method to construct all,but one,133-cubic graphs.1.PrliminariesLet G be a nontrivial loopless graph with vertex—set V(G)and edge-setE(G),denoted as V and E respectively.A subgraph L of G is called a maxi-mum bipartite Subgraph,denoted as MBS,if L has a maximum number of |
| 本文献已被 CNKI 等数据库收录！ | |