波兰表达式构成图的最大最小度

本文主要研究了波兰表达式构成图顶点的最大最小度.通过对三个扰动条件的分析计算出此图所能达到的最大度。

Based on Wong＇s theory of Polish expressions,We introduced graph theory for the floorplanning problem.In this paper,we discuss the maximum degree and the minimum degree.The maximum degree we calculated is,when is greater than or equal to.And when is smaller than or equal to,it is.At the same time,The minimum degree we calculated is.