期刊论文详细信息
Al-Rafidain Journal of Computer Sciences and Mathematics
Incomplete (rq-q+r- ɛ , r)-arcs and minimal {ℓ,t}-Blocking set in PG(2,q)
Hiba najem1  Nada Yahya2 
[1] College of Education for pure sciences University of Mosul;University of Mosul/College of Education for Pure Science/Department of Mathematics;
关键词: incomplete (rq-q+r-ɛ;    r)-arcs;    minimal{ℓ;    t}-blocking set;    t-blocking set;    projective plane pg(2;    q);   
DOI  :  10.33899/csmj.2014.163738
来源: DOAJ
【 摘 要 】

We proved that(rq-q+r-ɛ,r)-arcs is incomplete  by using minimal {ℓ,t}-Blocking set in projective plane PG(2,q)and we found a new condition for ɛ is ɛ ≥-A(r-1)2+B(r-1)-C and A,B,C is a constant which is not get previously in studies which is search in finding ɛ  for incomplete (rq-q+r-ɛ,r)-arcs ,for value 2≤r≤ 4  where q is prime for values 11≤q≤ 31  in addition to  q=16.

【 授权许可】

Unknown   

  文献评价指标  
  下载次数:0次 浏览次数:0次