نتایج جستجو برای: n 3
تعداد نتایج: 2517781 فیلتر نتایج به سال:
2006
H. Cao
Letn ≡ k−1, 0 or 1 (mod k).An R̃MP(k, ; n,m) (resp. R̃MC(k, ; n,m)) is a resolvable packing (resp. covering)withmaximum (resp. minimum) possible number m of parallel classes which are mutually distinct, each parallel class consists of (n− k + 1)/k blocks of size k and one block of size n− k (n− k+ 1)/k , and its leave (resp. excess) is a simple graph. Such designs can be used to construct certain...
Journal:
:Chemical and Pharmaceutical Bulletin
1980
Journal:
:Inorganic Chemistry Communications
2015
Journal:
:Acta Crystallographica Section E Structure Reports Online
2011
Journal:
:Acta Crystallographica Section E Crystallographic Communications
2015
Journal:
:Revista Estudos e Pesquisas em Administração
2019
Journal:
:Acta Crystallographica Section E Structure Reports Online
2011
Journal:
:Acta Crystallographica Section E Crystallographic Communications
2015
Journal:
:Acta Crystallographica Section E Structure Reports Online
2011
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید