ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES
Issue Date:
2012
Abstract(summary):
A t-hyperwheel (t a parts per thousand yen 3) of length l (or W (l) ((t)) for brevity) is a t-uniform hypergraph (V,E), where E = {e (1), e (2), aEuro broken vertical bar, e (l) } and v (1), v (2), aEuro broken vertical bar, v (l) are distinct vertices of such that for i = 1, aEuro broken vertical bar, l, v (i) , v (i) +1 a e (i) and e (i) a (c) e (j) = P, j a < {i - 1, i, i + 1}, where the operation on the subscripts is modulo l and P is a vertex of V which is different from v (i) , 1 a parts per thousand currency sign i a parts per thousand currency sign l. In this paper, the minimum covering problem of MC (lambda) (3,W (4) ((3)) , v) is investigated. Direct and recursive constructions on MC (lambda) (3,W (4) ((3)) , v) are presented. The covering number c (lambda) (3,W (4) ((3)) , v) is finally determined for any positive integers v a parts per thousand yen 5 and lambda.