几类冠图的临界群-运筹学与控制论专业论文.docxVIP

(2a)点冠图％o (2a)点冠图％o R的临界群为： K(％o R)星(z口。+。一an)m， 其中序列a。定义为：an=3a。一1一an一2，a1=1，a2：2． (2b)边冠图％◇R的临界群为： K(Tm o R)冬 f(z(删n))一1。(z黜)一1， 当扎=2后+埘， {(z(¨2^))m-1。(z黼)m～，当n=2k且k为奇数时， l(z世当蝴)一1 o(z i兰趔鱼)一1，当n=2k且k为偶数时． in+2，￡t1) 其中序列厶定义为：tn=4tn—l—tn一2，to=0，t1=1． (3)树与星图的冠图的临界群 (3a)点冠图％o最的临界群为： K(T,n o)竺(z2)(铲3胁e(Z2(n+1))m． (3b)边冠图％◇的临界群为： 骗矧岂P‘n(-矿3)(m-13)，：嚣乏茹Z”3(n+¨3，)P～’判当3 1((川n+3)时．)Eta, (4)树与完全图的冠图的临界群 (4a)点冠图％o％的临界群为： K(％O％)竺(Z，l+1)m． (4b)边冠图％o％的临界群为s K(％◇％)竺(‰+2)m～． II (5)圈与完全图的冠图的临界群 (5)圈与完全图的冠图的临界群 (5a)点冠图G o‰的临界群为： K(G K．m)笺z(n，m+1)o(Zm+1)(m一1m一1 o Z呈f竺±婪． (5b)边冠图G o‰的临界群为： K(Ckoj‘n)皇(Zm+2)m以一2oz2(m+2)n． 关键词：Laplacian矩阵；临界群；Smith标准形；树；圈：路；星图；完 全图；点冠图；边冠图． III ABSTRACTTile ABSTRACT Tile critical group of graph is finite abelian group．It is a refinement of the number of spanning trees of the graph，which is a subtle isomorphism in- variant of the graph and is closely connected with the graph Laplacian matrix． In this paper，the structure of the critical groups of the corona of trees and cycles，paths，stars，complete graphs and the corona of cycles and complete graphs are determined and the explicit expression of the Smith normal forms of critical group on these graphs are given．we proved that (1)the critical group of the corona of trees and cycles (1a) the critical group of the vertex corona of trees and cycles： 隅吲垒k一。群善毁。mi摭嚣 where|n is the Fibonac癌sequence． (1b)the critical group of the edge corona of trees and cycles： if n=2k+1 is odd， K(2k◇(死)竺(Z(n+2，u。))m一1 o(‰々)m一1 o(z 51善21≮)m一1， and if n=2k and k is odd then K(Tm。G)垒(z(n讹旷1。(z糍裂)州。(z器端)m．1， and if n=2k is even and k iS eve{l then K(Tm◇G)兰(z掣)州(Zw2vk(n+2,3Vk))州。(z踹糌)州， V where where the sequence Uk is defined as u知2 4Uk一1一钆知一2，钆o=1，U1=5；the sequence讥is defined as讥2 4Vk一1一仇一2，Vo=0，饥2 1． the critical group of the corona of trees and paths (2a)the critical group of the vertex corona of trees and paths： K(％o R)笺(Z‰+。一口。)m， where the sequence an is defined as an=3an—l一‰一2，a1=1，a2=2． (2b)the critical group of the edge