【摘要】：多邊形鏈P(i_1,i_2,···,i_t)是由t個(gè)不同的多邊形P_(i1),P_(i2),···,P_(it)構(gòu)成的簡(jiǎn)單圖,其中任意兩個(gè)多邊形Pik和Pij經(jīng)一條鍵相連當(dāng)且僅當(dāng)對(duì)任意的1≤kj≤t有j=k+1,而且每一條鍵至多屬于兩個(gè)多邊形.文章研究了多邊形鏈的Merrifield-Simmon指標(biāo)的極值,同時(shí)筆者也刻畫了相應(yīng)的極值圖.
[Abstract]:A polygonal chain P (I _ 1, I ~ 2, I _ t) is a simple graph consisting of t different polygons P _ (i1), P _ (i2), P _ (it), Any two polygons, Pik and Pij, are connected by a key if and only if any 1 鈮，

本文編號(hào)：2441677