两个二部图设计到其子图设计的变化-计算数学专业论文.docxVIP

AbstractLet Abstract Let K。be complete graph of order u，and G finite simple graph．A graph design G—GDA(v)(graph packing G—PDA(u)，graph covering G-CDa(v)) is pair(X，B)，where X is the vertex set of K?。and B is collection of subgraphs of Ku， called blocks，such that eadl block is isomorphic to G and each edge in in exactly(at most，at least)A blocks of召．A graph packing(or covering)is said to be maximum(or minimum)if other such graph packing(or covering)with the same order，has more(or fewer)blocks， denoted by G—PDa(v)(rain G—cDA())．The number of blocks in maximum G— packing(or mininmm G—covering)is denoted by p(u，G，A)(or c(v，G，入))．A G-PDA(v)(or G-CDA())is said t。be regular ifp(，G，A)=LA2vIE(v(-G1))l Ji＼[or『窆}{8崭]=c(u，G，A))，denoted by G—OPDA(v)(G—OCDA())． Let(X，B)be G—GDA(v)and H subgraph of G．For each block B∈B，partition B into B7 and B＼B7，where B7 is isomorphic to H．Define B(H)={B’：B∈B)．If the edges in V(G＼H)={B＼B’：B∈B]．can be reassembled into collection D(H)of copies of H，then(X，B(H)U口(H))is H—GDA(u)．The procedure abeve is called metamorphosis of G—GDa(v)into H—GDa(v)and denoted by(GH)一G慨(u)． In this thesis，the spectrums of metamorphosis of two bipartite graph designs into subgraph designs determined．Meanwhile，the problems of graph design，optimal packing design and optimal covering design of 4 graphs with vertices and edges solved completely． Keywords：Metamorphosis；Graph Design；Graph Packing；Graph Covering IV 万方数据 目 目 录 中文摘要 ．．III 英文摘要 ．．IV 引言 ． ． ．． ． ．． 1 第一章 入重虬．3-设计到A重a一设计的变化 ．． 3 1．1 递归构作 3 1．2 必要条件 ． ． ． 3 1．3 A=1 · · ．．． ．．．．．．． ．．．．．．．． ．． 5 1．4 A=2 ． 5 1．5 A=3 · ． ． ． ． ．．． ．． 6 1．6 A=4 ． ． ．． 6 1．7 入=6 ． 7 1．8 A=12··· 7 第二章 A重恐13-设计到A!重T-设计的变化 ．． 9 2．1 A=1 ．．． ．10 2．2 A=2 ．11 2．3 A=3 -．． ． 12 2．4 A=4 ． ． ． ．12 2．5 入=6 ．．． ． ．． ．．． ．． ．．13 2．6 A=12 ． ．．． ．． ．．． ． ．．13 第三章A重虬，3＼{e)-设计到A重G．设计的变化 15 3．1 A=1 · ． ． ．． ．．15 3．2 A=2 ·· ． ．． ．．16 3．3 A=3 · · ．．． ．．． ．．． ． ．． ．． ． ．．17 3．4 A=4 ··· · ． ．．18 V 万方数据 3．5 3．5 A=6．．．．．．．．．．．．．．．．．．．．．．．．．．． ．．．．．．．．．．．