论文部分内容阅读
为构造机电产品拆卸与或图模型,需对拆卸与或图进行连通性筛选。在图论、二值布尔代数和组合学的基础上,利用图及其导出子图、布尔矩阵、布尔向量、组合等工具,提出了部件顶点连通性判定定理和连通部件顶点构造定理,并给出了连通性筛子顶点筛选率的上限与下限。通过连通性筛选,剔除了拆卸与或图中的不合理部件顶点,并使顶点数量得到有效削减。连通性筛子顶点筛选率的限值为合理安排所有筛子的筛选顺序提供了基础。
To construct a mechanical and electrical product disassembly and or graph model, the disassembly and or graph connectivity screening is required. On the basis of graph theory, binary Boolean algebra and combinatorics, this paper puts forward the theorem of determining vertex connectivity of components and the vertex structuring theorem of connected components by means of graphs and their derived subgraphs, Boolean matrices, Boolean vectors and combinations. Out of the connectivity screen vertex screening rate of the upper and lower limits. Through the connectivity screening, the vertices of the unreasonable parts in the disassembly and / or figure are eliminated, and the number of vertices is effectively reduced. The limits of connectivity screening vertex screening rates provide the basis for a reasonable arrangement of screening orders for all screens.