نتایج جستجو برای: maximum fruit diameter

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

2012
Byeong Moon Kim Byung Chul Song Woonjae Hwang

The Klee-Quaife problem is finding the minimum order μ(d, c, v) of the (d, c, v) graph, which is a c-vertex connected v-regular graph with diameter d. Many authors contributed finding μ(d, c, v) and they also enumerated and classified the graphs in several cases. This problem is naturally extended to the case of digraphs. So we are interested in the extended Klee-Quaife problem. In this paper, ...

2010

The respiration of individual 'Hass' and 'Fuerte' fruit was monitored during storage at 8oC and 10oC respectively for 14 days, under a continuous flow of humidified air containing ethylene (C2H4) at 0, 0.01, 0.05, 0.25, 1.0 and 5.0 μL.L. Respiration rates of 'Fuerte' fruit under 0.01 μL.L C2H4 were significantly higher than the controls after 3.3 days of storage, but for 'Hass' fruit respiratio...

Journal: :Discrete Mathematics 2002
Joze Marincek Bojan Mohar

It is proved that computing the maximum diameter ratio also known as the local density of a graph is APX complete The related problem of nding a maximum subgraph of a xed diameter d is proved to be even harder to approximate

Journal: :Ars Comb. 2001
Teresa W. Haynes Christina M. Mynhardt Lucas C. van der Merwe

Denote the total domination number of a graph G by γt(G). A graph G is said to be total domination edge critical, or simply γtcritical, if γt(G + e) < γt(G) for each edge e ∈ E(G). For 3t-critical graphs G, that is, γt-critical graphs with γt(G) = 3, the diameter of G is either 2 or 3. We characterise the 3t-critical graphs G with diam G = 3.

2017
António Girão Gábor Mészáros Kamil Popielarz Richard Snyder

A graph is path-pairable if for any pairing of its vertices there exist edge disjoint paths joining the vertices in each pair. We obtain sharp bounds on the maximum possible diameter of path-pairable graphs which either have a given number of edges, or are cdegenerate. Along the way we show that a large family of graphs obtained by blowing up a path is path-pairable, which may be of independent...

Journal: :journal of agricultural science and technology 2016
d. soloman george z. razali c. somasundram

the physical and physiological characteristics of sarawak pineapple were studied at five different stages of growth from one to five months after anthesis. changes in fruit length, diameter, pulp color, pulp firmness, ph, total soluble solids, titratable acidity, ascorbic acid content and antioxidant activity were monitored. the sarawak pineapple exhibited a sigmoid growth pattern during fruit ...

Journal: :Journal of Graph Theory 2006
Boris Bukh

Given a configuration of pebbles on the vertices of a graph G, a pebbling move consists of taking two pebbles off some vertex v and putting one of them back on a vertex adjacent to v. A graph is called pebbleable if for each vertex v there is a sequence of pebbling moves that would place at least one pebble on v. The pebbling number of a graph G is the smallest integer m such that G is pebbleab...

2017
Zhaojiang Meng Aiwang Duan Deli Chen Kithsiri Bandara Dassanayake Xiaosen Wang Zugui Liu Hao Liu Shengguo Gao

It is very important to seek a simple nondestructive method to continuously measure plant water status for irrigation scheduling. Changes in stem diameter in response to plant water status and soil water content (SWC) were experimentally investigated during the growing seasons of 2011/2012 and 2012/2013 in pot-cultivated tomato (Lycopersicon esculentum L.) plants in a plastic greenhouse. This s...

2014
Majid Rashidi Saeed Mohammadi

Field experiments were carried out to study the interactive effects of plastic mulch and tillage method on yield and quality of tomato (Lycopersicon esculentum) during 2007 and 2008 growing seasons. Mulch levels in the study were plastic-mulching (PM; black plastic mulch) and no-mulching (NM) and tillage treatments were conventional tillage (CT; moldboard plowing + two passes of disk harrowing)...

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

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