The Atom-bond-connectivity index ABC of a graph G is determined by d_i and d_j. In this paper, sharp results for the general which has chemical applications are found using different methods. These new inex investigated in terms its edges, vertices degrees. particular, some relations obtained involving topological indices; Randic index, Zagreb Harmonic Narumi-Katayama index. Indeed, improved he...

A connected graph G is said to be k-connected if it has more than k vertices and remains whenever fewer are deleted. In this paper, for a with sufficiently large order, we present tight sufficient condition fixed minimum degree based on the Q-index. Our result can viewed as spectral counterpart of corresponding Dirac-type condition.

The Harary index of a graph is defined as the sum of reciprocals of distances between all pairs of vertices of the graph. In this paperweprovide anupper boundof theHarary index in terms of the vertex or edge connectivity of a graph. We characterize the unique graph with themaximumHarary index among all graphs with a given number of cut vertices or vertex connectivity or edge connectivity. In ad...

In this paper, a new access method is proposed for current positions of moving objects on road networks in order to efficiently update their positions. In the existing index structures, the connectivity ofedges is lost because the intersection points in which three or more edges are split. The proposed index structure preserves the network connectivity, which uses intersection oriented network ...

The right and left hand Motor Imagery (MI) analysis based on the electroencephalogram (EEG) signal can directly link the central nervous system to a computer or a device. This study aims to identify a set of robust and nonlinear effective brain connectivity features quantified by transfer entropy (TE) to characterize the relationship between brain regions from EEG signals and create a hierarchi...