نتایج جستجو برای: capitulum diameter

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

Journal: :International Journal of Enviornment and Climate Change 2023

A field experiment was conducted during Kharif 2022 at Crop Research Farm, Department of Agronomy, Sam Higginbottom University Agriculture, Technology And Sciences, Prayagraj (U.P). To determine the “Influence phosphorus and sulphur on growth yield sunflower (Helianthus annuus L.)”, The results showed that treatment 9 [Phosphorus (60 kg/ha) + Sulphur 25 kg/ha] recorded significantly higher plan...

Journal: :journal of nanostructures 2014
s. feshki m. marandi

carbon spheres were fabricated by hydrothermal method and their structural properties were investigated. carbon spheres with average sizes around of 230, 320 and 430 nm were synthesized in different concentration of glucose aqueous solution and different hydrothermal reaction time. the temperature of 180 °c by a hydrothermal reaction was fixed in all of glucose concentration and hydrothermal re...

Journal: :communication in combinatorics and optimization 0
p. dankelmann university of johannesburg

the average distance of a vertex $v$ of a connected graph $g$is the arithmetic mean of the distances from $v$ to allother vertices of $g$. the proximity $pi(g)$ and the remoteness $rho(g)$of $g$ are defined as the minimum and maximum averagedistance of the vertices of $g$. in this paper we investigate the difference between proximity or remoteness and the classical distanceparameters diameter a...

Asha B. Ganagi, Harishchandra S. Ramane, Ivan Gutman,

The diameter of a connected graph $G$, denoted by $diam(G)$, is the maximum distance between any pair of vertices of $G$. Let $L(G)$ be the line graph of $G$. We establish necessary and sufficient conditions under which for a given integer $k geq 2$, $diam(L(G)) leq k$.

Journal: :Int. J. Comput. Math. 2002
Ayman Abdalla Narsingh Deo

A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to minimize the number of messages communicated among processors per critical section. Understanding the behavior of tree diameter is useful, for example, in determining an upper bound on the expected number of links bet...

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

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