多边形链的Merrifield-Simmons指标的极值(英文)
发布时间:2019-03-16 15:51
【摘要】:多边形链P(i_1,i_2,···,i_t)是由t个不同的多边形P_(i1),P_(i2),···,P_(it)构成的简单图,其中任意两个多边形Pik和Pij经一条键相连当且仅当对任意的1≤kj≤t有j=k+1,而且每一条键至多属于两个多边形.文章研究了多边形链的Merrifield-Simmon指标的极值,同时笔者也刻画了相应的极值图.
[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 鈮,
本文编号:2441677
[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 鈮,
本文编号:2441677
本文链接:https://www.wllwen.com/kejilunwen/yysx/2441677.html