摘要
考察了一些金字塔网的性质,并利用这一性质,证明了PM[n](n≥1)是一个超3边连通图,进而得到其限制边连通度λ′(PM[n])=5(n≥2).
The properties of some pyramid networks are investigated in this paper. It is the properties that PM[n]（n ≥ 1） is a super 3-edge connectivity graph . Furthermore, connectivity of pyramid networks is determined ad λ′（PM[n]） = 5 （n ≥ 2）. proved by means of the restricted edge
出处
《西南大学学报（自然科学版）》
CAS
CSCD
北大核心
2007年第8期39-42,共4页
Journal of Southwest University(Natural Science Edition)
基金
陕西省自然科学基金资助项目(2005A07)
关键词
2-维格网
金字塔网
限制边连通度
2-dimensional grid network
pyramid network
restricted edge connectivity
