关于图的分数横贯的一个注记  

A note on fractronal transversals of graphs

作　　者：林荣斐[1] 卜月华[2] 

机构地区：[1]台州学院数学系,浙江临海317000 [2]浙江师范大学数理与信息科学学院,浙江金华321004

出　　处：《浙江师范大学学报（自然科学版）》2002年第4期334-336,共3页Journal of Zhejiang Normal University:Natural Sciences

摘　　要：对于一个超图H,有等式maxs≥1υs(H)s=υ (H)=τ (H)=mink≥1τk(H)k.若H是简单图G,用纯图论的方法证明了τ (G)=τ2(G)2=υ2(G)2,现用线性代数的方法证明这一等式成立.用这一方法有希望刻划出对于r 一致超图H来说达到最大、最小值所对应的s及k.Every hypergraph H satisfies the following equality: \{max\}s≥1υ\-s(H)s=υ\+*(H)=τ\+*(H)=\{\{min\}k≥1τ\-k(H)k\}.If H is a simple graph G, then G satisfies the equality:τ\+*(G)=τ\-2(G)2=υ\-2(G)2. This equality was proved by pure graph method. This paper proved it by linear algebra method. Using this method, it is possible to characterize the numbers s and k when they achieve the maximun or the minimun for runiform hypergraph.

关 键 词：关联矩阵 分数横贯数 分数匹配数 一致超图 多面体 

分 类 号：O157.5[理学—数学]