Font Size: a A A

Perfect T(G)-triple Systems For Subgraphs G Of K5 With Eight Edges Or Less

Posted on:2009-03-26Degree:MasterType:Thesis
Country:ChinaCandidate:Y L ZhangFull Text:PDF
GTID:2120360245962252Subject:Applied Mathematics
Abstract/Summary:PDF Full Text Request
Let G be a subgraph of Kv.For each edge of G,add a new vertex and replace each edge by a 3-cycle,in which all vertices are distinct each other,then the obtained configuration is called a T(G)-triple.In a T(G)-triple,the edges of G are called interior edges,but the edges of T(G)-G are called exterior edges.An edge-disjoint decomposition of 3Kv into copies of T(G)-triple is called a T(G)-triple system of order v.Further,if all the interior edges in a T(G)-triple system exactly form an edge-disjoint decomposition of Kv,then the T(G)-triple system is said to be perfect.In recent papers by E.J.Billington,C.C.Lindner,S.Kü(?)ük(?)if(?)i and A.Rosa,the existence for perfect T(G)-triple system have been completely solved,where G is any subgraph of K4.For the star graph K1,kand any prime power k,Yuanyuan Liu and Qingde Kang have given the spectrums of perfect T(K1,k)-triple system and perfect T(K1,2k)-triple system.The same problem for any subgraph G of K5 with eight edges or less will be discussed in this paper.
Keywords/Search Tags:T(G), T(G)-triple system, perfect T(G)-triple system
PDF Full Text Request
Related items