Let k ≥ 2 be an integer, a k-decomposition (G1,G2, . . . ,Gk) of the complete graph Kn is a partition of its edge set to form k spanning subgraphs G1,G2, . . . ,Gk. In this contribution, we investigate the Nordhaus–Gaddum-type inequality of a k-decomposition of Kn for the general Zagreb index and a 2-decomposition for the Zagreb co-indices, respectively. The corresponding extremal graphs are ch...

one of the most fundamental features of digital image and the basic steps in image processing, analysis, pattern recognition and computer vision is the edge of an image where the preciseness and reliability of its results will affect directly on the comprehension machine system made objective world. several edge detectors have been developed in the past decades, although no single edge detector...

Leaf and canopy nitrogen (N) status relates strongly to leaf and canopy chlorophyll (Chl) content. Remote sensing is a tool that has the potential to assess N content at leaf, plant, field, regional and global scales. In this study, remote sensing techniques were applied to estimate N and Chl contents of irrigated maize (Zea mays L.) fertilized at five N rates. Leaf N and Chl contents were dete...

Most North American bird species that are less successful in small forests than in large forests, are forest-interior specialists that winter in the tropics. These species have declined in small forests because of high rates of nest predation and brood parasitism near the forest edge. To determine whether migratory forest-interior specialists are also important components of bird communities in...

We present an adaptive refinement algorithm for T-splines on unstructured 2D meshes. While structured meshes, one can refine elements alternatingly in horizontal and vertical direction, such approach cannot be generalized directly to where no two unique global mesh directions assigned. To resolve this issue, we introduce the concept of direction indices, i.e., integers associated each edge, whi...

There is a growing need for developing high-throughput tools for crop phenotyping that would increase the rate of genetic improvement. In most cases, the indicators used for this purpose are related with canopy structure (often acquired with RGB cameras and multispectral sensors allowing the calculation of NDVI), but using approaches related with the crop physiology are rare. High-resolution hy...

In this paper, we obtain some upper and lower bounds for the general extended energy of a graph. As an application, we obtain few bounds for the (edge) Zagreb energy of a graph. Also, we deduce a relation between Zagreb energy and edge-Zagreb energy of a graph $G$ with minimum degree $delta ge2$. A lower and upper bound for the spectral radius of the edge-Zagreb matrix is obtained. Finally, we ...

Let G be a graph and k positive integer. A strong k-edge-coloring of is mapping $$\phi : E(G)\rightarrow \{1,2,\dots ,k\}$$ such that for any two edges e $$e'$$ are either adjacent to each other or common edge, (e)\ne \phi (e')$$ . The chromatic index G, denoted as $$\chi '_{s}(G)$$ , the minimum integer has k-edge-coloring. Lv, Li Zhang [Graphs Combinatorics 38 (3) (2022) 63] proved if claw-fr...

In several areas like global optimization using branch-and-bound methods for mixture design, the unit n-simplex is refined by longest edge bisection (LEB). This process provides a binary search tree. For n > 2, simplices appearing during the refinement process can havemore than one longest edge (LE). The size of the resulting binary tree depends on the specific sequence of bisected longest edge...