Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4647615 | Discrete Mathematics | 2013 | 8 Pages |
Abstract
Let (X,B) be a (λKn,G)-covering with excess E and a blocking set T. Let Î1, Î2, â¦, Îs be all connected components of E with at least two vertices (note that s=0 if E=0̸). The blocking set T is called tight if further V(Îi)â©Tâ 0̸ and V(Îi)â©(XâT)â 0̸ for 1â¤iâ¤s. In this paper, we give a complete solution for the existence of a minimum (λKn,G)-covering admitting a blocking set (BS), or a tight blocking set (TBS) for any λ and when G=K3 and G=K3+e.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Yanxun Chang, Giovanni Lo Faro, Antoinette Tripodi, Junling Zhou,