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$.

Detecting banana pseudostems is an indispensable part of the intelligent management cultivation, which can be used in settings such as counting and smart fertilization. In complex environments, dense occlusion pose a significant challenge for detection. This paper proposes improved YOLOV7 deep learning object detection algorithm, YOLOV7-FM, detecting with different growth conditions. loss optim...

Maintenance of garlic (Allium sativum L.) genetic resources has had a long tradition in the Czech Republic. The collection was founded in 1951 and its current holder is the Crop Research Institute, Department of Vegetables and Special Crops in Olomouc. The collection consists of 613 genotypes. The oldest genotype was acquired in 1954. The collection has been evaluated according to the Descripto...

to determine the droplet characteristics of agricultural spray nozzles through water sensitive paper (wsp), the non-circular and overlapped spots appearing on the water sensitive paper surfaces are eliminated. in the conventional approach, the procedure is done according to the subjective self determined estimation of the operator. the objective of this study was to develop a practical alternat...

the drilling is well known as one of the most common hole making processes in the industry.due to close tolerance requirement for drilled holes in the most of work pieces, onlinecontrolling of the diameter of drilled holes seems to be necessary. in the current work, an onlinedimensional controlling system was developed for drilling process. doing this, drilling processwas executed in different ...

In 1978, Chvátal and Thomassen proved that every 2-edge-connected graph with diameter 2 has an orientation with diameter at most 6. They also gave general bounds on the smallest value f(d) such that every 2-edge-connected graph G with diameter d has an orientation with diameter at most f(d). For d = 3, their general bounds reduce to 8 ≤ f(3) ≤ 24. We improve these bounds to 9 ≤ f(3) ≤ 11.