The class of graphic arrangements are the graphic arrangements of n-edge ladder.
第三章研究一类图构形的φ_n不变量,这里所指的一类图构形是n.梯子对应的图构形。
A special class of graphic arrangements are studied,which are determined by a kind of graphs called n-edge ladder.
研究了一类特殊的图构形,它们所对应的图由l个n边形组成,使其相邻两个n边形有一条公共边,这种图叫做长度为l的n.梯子,通过逻辑推导与论证得出关于n.梯子构形的φn不变量的结论φn=(n-1)l。