摘要
布尔图是与n 维立方图的导出子图同构的图 .布尔图的一个重要特征是它的顶点可以用 0 1序列标号刻划 .利用对图的顶点进行 0 1序列标号的方法证明路、偶圈以及树都是布尔图 ,并且得出路、偶圈维数的上界估计 .
A graph is called Boolean Graph if there is an isomorphism between the graph and an induced subgraph of an n cube.The boolean graph can be marked by the 0 1 binary.So path、even cycle and tree are proved to be boolean graphs,meanwhile the upper bounds on the dimensions of path and even cycle are given.
出处
《山东大学学报（自然科学版）》
CSCD
2000年第4期381-386,共6页
Journal of Shandong University(Natural Science Edition)
