{C4,2K2}-free图零度基础数学专业论文.docxVIP

V V Theorem 4.3: Let G be a {C4, 2K2} - f ree graphs , GII is the induced subgraph of GI = G[V1, V2] ? E(G[V2]) and GII no isolated vertex . If G satisfied : (1) |V1| |V2| ? 1 G is partly decomposable GII ～= every subgraph of G? , each subgraph contains |V1|K2 Then η(G) = 0 . Theorem 4.5:Let G be a {C4, 2K2} - f ree graphs If G satisfied : (1) |V1| = |V2| ? 1 for bipartite graph GI = G[V1, V2] ? E(G[V2]) ～= every subgraph of G? , each subgraph contains |V1|K2 G is partly decomposable then : η(G) = 1 when V3 = ? ; η(G) = 0 when V3 /= ? . In Section 5 ，we consider some problems of spectrum . The structure and spectrum of maximal nullity on V3 = ? has been given by theorem 3.1 . But there is much difficult to characterize the structure and spectrum of maximal nullity on V3 /= ? . In order to solve this problem better , we given theorem 5.1 , use theorem 5.1 and other results , at last , characterize the structure and spectrum of maximal nullity on V3 /= ? . Theorem 5.1:Let GI be a simple graph , if GI satisfied : V (GI) = V2 ∪ V3，V2 induced a clique , V3 induced a 5-cycle in GI (2) ?vi ∈ Vi(i = 2, 3) v2v3 ∈ E then : (1) Eig(GI) = Eig(GI[V2]) ∪ Eig(GI[V3]) ? ρ(GI[V2]) ? ρ(GI[V3]) . 2the largest eigenvalue λ1 and the smallest eigenvalue λn are simple root . They are symmetric about |V2|+1 . 2 ?λi ∈ Eig(GI) ，it’s multiple as same as the multiple in graph. (4) λ1 = ?(λ2 + · · · + λn) . Theorem 5.2:Let G be a {C4, 2K2} - f ree graphs , V3 /= ? , |V (G)| = n 注 2 then : (1) Nullity η(G) is n ? |V2| ? 5 , when V1 is isolated vertex set. (2) spec(G) = / λ1 μ2 0 ?1 μ3 λn 、 .1 2 n ? |V2| ? 5 |V2| ? 1 2 1 . KEY WORDS:nullity，spectral radius，partly decomposable，free graph I I 新疆师范大学学位论文原创性声明 本人郑重声明:所呈交的学位论文，是本人在导师的指导下，独立进行研究 工作所取得的成果。除文中己经注明引用的内容外，本论文不含任何其他个人或集体 己经发表或撰写过的作品成果。对本文的研究做出重要贡献的个人和集体，均己在文 中以明确方式标明。本人完全意识到本声明的法律结果由本人承担。 学位论文作者签名: 日期: 年 月 日 关于论文使用授权的说明 学位论文作者完全了解新疆师范大学有关保留和使用学位论文的规定，即:研 究生在校攻读学位期间论文工作的知识产权单位属新疆师范大学。学校有权保留井 向国家有关部门或机构送交论文的复印件和电子版，允许学位论文被查