Crop biomass is a critical variable for characterizing crop growth development, understanding dry matter partitioning, and predicting grain yield. Previous studies on the spectroscopic estimation of crop biomass focused on the use of various spectral indices based on chlorophyll absorption features and found that they often became saturated at high biomass levels. Given that crop biomass is com...

Let $G$ be a graph with vertex set $V(G)$ and edge set $E(G)$, and let $d_u$ denote the degree of vertex $u$ in $G$. The Randi'c index of $G$ is defined as${R}(G) =sum_{uvin E(G)} 1/sqrt{d_ud_v}.$In this paper, we investigate the relationships between Randi'cindex and several topological indices.

Let G be a simple graph with the vertex set V(G) and edge set E(G) respectively. The degree of a vertex v in G is the number of vertices in G which are connected to v by an edge and denoted by dG(v). A topological index is a graph invarient which is numerical parameter obtained from a graph which characterize its topology.Thus for two isomorphic graphG and H the value of a particular topologica...

A strong edge-coloring of a graph is a function that assigns to each edge a color such that two edges within distance two apart receive different colors. The strong chromatic index of a graph is the minimum number of colors used in a strong edge-coloring. This paper determines strong chromatic indices of cacti, which are graphs whose blocks are cycles or complete graphs of two vertices. The pro...

Global connectivity is a quite important issue for networks. The failures of some key edges may lead to breakdown of the whole system. How to find them will provide a better understanding on system robustness. Based on topological information, we propose an approach named LE (link entropy) to quantify the edge significance on maintaining global connectivity. Then we compare the LE with the othe...

The edge and total versions of geometric-arithmetic (GA) index of graphs are introduced based on the end-vertex degrees of edges of their line and total graphs, respectively. In this paper, the edge and total GA indices are computed for some graphs by using some results on GA index and graphs.

Szeged-like topological indices are well-studied distance-based molecular descriptors, which include, for example, the (edge-)Szeged index, (edge-)Mostar and (vertex-)PI index. For these indices, corresponding polynomials were also defined, i.e., polynomial, Mostar PI etc. It is well known that, by evaluating first derivative of such a polynomial at x=1, we obtain related The aim this paper to ...