نتایج جستجو برای: irredundance number

تعداد نتایج: 1168378  

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه فردوسی مشهد - دانشکده کشاورزی 1390

abstract previous researches have shown success of growth hormones usage on flower production increase, pod and prevention of abscission of them in some of the pulses. two tests were done, in order to find out the effects of growth hormones to on flower production increase, pod and chick pea yield composites in farmer conditions (2010-11) and green house conditions as factorial on the proje...

Journal: :Discrete Mathematics & Theoretical Computer Science 2011
Alewyn P. Burger Jan H. van Vuuren

The irredundant Ramsey number s = s(m,n) [upper domination Ramsey number u = u(m,n), respectively] is the smallest natural number s [u, respectively] such that in any red-blue edge colouring (R,B) of the complete graph of order s [u, respectively], it holds that IR(B) ≥ m or IR(R) ≥ n [Γ(B) ≥ m or Γ(R) ≥ n, respectively], where Γ and IR denote respectively the upper domination number and the ir...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه تربیت مدرس - دانشکده منابع طبیعی و علوم دریایی 1388

this research was conducted in two protect and destroy region in the middle zagros, in illam province. in order to identification of ecological species group and evaluate density of regeneration, effect of many factors such as protection, vegetation, physiographic factors, physical and chemical properties of soil in study locations were studied. to achieve these purpose number of 54 plots using...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه شهید مدنی آذربایجان - دانشکده علوم پایه 1392

let g=(v,e) be a graph with vertex set v and edge set e.for two vertices u,v of g ,the closed interval i[u,v] ,consists of u,v and all vertices lying in some u-v geodesic in g.if s is a set of vertices of g then i[s]is the union of all sets i[u,v]for u,v ? s. if i[s]=v(g) , then s is a geodetic set for g.the geodetic number g(g) is the minimum cardinality of geodetic set.the maximum cardinalit...

Journal: :Australasian J. Combinatorics 2001
Matthew D. Kearse Peter B. Gibbons

We describe various computing techniques for tackling chessboard domination problems and apply these to the determination of domination and irredundance numbers for queens’ and kings’ graphs. In particular we show that γ(Q15) = γ(Q16) = 9, confirm that γ(Q17) = γ(Q18) = 9, show that γ(Q19) = 10, show that i(Q18) = 10, improve the bound for i(Q19) to 10 ≤ i(Q19) ≤ 11, show that ir(Qn) = γ(Qn) fo...

Journal: :Ann. Pure Appl. Logic 2000
Andrzej Roslanowski Saharon Shelah

We address several questions of Donald Monk related to irredundance and spread of Boolean algebras, gaining both some ZFC knowledge and consistency results. We show in ZFC that irr(B0 × B1) = max{irr(B0), irr(B1)}. We prove consistency of the statement “there is a Boolean algebra B such that irr(B) < s(B ~ B)” and we force a superatomic Boolean algebra B∗ such that s(B∗) = inc(B∗) = κ, irr(B∗) ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید