一个本原图的scrambling指数

The scrambling index of a primitive graph

若存在非负整数k(k>0),D中的每一对顶点(u,v)都存在另一顶点w,使得从w到u和v都有长为k的途径,且这个k是所有满足上述条件中的最小的整数,就是D的scram-bling指数,记作k(D).文章给出了一个特殊的本原图的scrambling指数.

If there is nonegative integer k（k0）,the vertex（u,v） of D has another vertex,and the length between w and u is same with the length between w and v,and k is the smallest integer,so it is the scrambling index of D,marked k（D）.In this paper,a new scrambling index of a special primitive graph was given.