The net primary productivity (NPP) and aboveground biomass mapping of crops based on remote sensing technology are not only conducive to understanding the growth development but can also be used monitor timely agricultural information, thereby providing effective decision making for production management. To solve saturation problem NDVI in crops, original CASA model was improved using narrow-b...

We introduce the notion of an anti-edge of a hypergraph, which is a non-overall polychromatic subset of vertices. The maximal number of colors, for which there exists a coloring of a hy-pergraph using all colors, is called an upper chromatic number of a hypergraph H and denoted by ¯ χ(H). The general algorithm for computing the numbers of all colorings of mixed (containing edge and anti-edge se...

The Padmakar-Ivan (PI) index of a graph G is the sum over all edges uv of G of the number of edges which are not equidistant from u and v. In this paper, the notion of vertex PI index of a graph is introduced. We apply this notion to compute an exact expression for the PI index of Cartesian product of graphs. This extends a result by Klavzar [On the PI index: PI-partitions and Cartesian product...

The ability of texture models and red-edge to facilitate the detection of subtle structural vegetation traits could aid in discriminating and mapping grass quantity, a challenge that has been longstanding in the management of grasslands in southern Africa. Subsequently, this work sought to explore the robustness of integrating texture metrics and red-edge in predicting the above-ground biomass ...

One of the more exciting polynomials among newly presented graph algebraic is M−Polynomial, which a standard method for calculating degree−based topological indices. In this paper, we define Mve−polynomials based on vertex edge degree and derive various vertex–edge indices from them. Thus, any graph, provide some relationships between Also, discuss general Mve−polynomial r−regular simple graph....

Let G be a simple graph of order n with eigenvalues λ1, λ2, · · · , λn and normalized Laplacian eigenvalues μ1,μ2, · · · ,μn. The Estrada index and normalized Laplacian Estrada index are defined as EE(G) = ∑n k=1 e λk and LEE(G) = ∑n k=1 e μk−1, respectively. We establish upper and lower bounds to EE and LEE for edge-independent random graphs, containing the classical Erdös-Rényi graphs as spec...

The total version of geometric–arithmetic (GA) index of graphs is introduced based on the end-vertex degrees of edges of their total graphs. In this paper, the total GA index is computed for zigzag polyhex nanotubes by using some results on GA index and mentioned nanotubes. Also, we compute the edge GA index for the subdivision graphs of TUC C (R) and TUAC [p',q'] nanotubes. 4 8 6

A G-Frobenius graph, as defined recently by Fang, Li, and Praeger, is a connected orbital graph of a Frobenius group G = K:H with Frobenius kernel K and Frobenius complement H. Γ is also shown to be a Cayley graph, Γ = Cay(K,S) for K and some subset S of the group G. On the other hand, a network N with a routing function R, written as (N,R), is an undirected graph N together with a routing R wh...