In this paper, we introduce a patch connectivity index and analyse its changes in relation to ecotope diversity and human impact intensity. Land-use maps of the newly born wetland at the Yellow River Delta of 1984, 1991 and 1996 were produced by applying an unsupervised and a supervised classification algorithm to the corresponding three scenes of Landsat Thematic Mapper (TM) images. A model fo...

The family of snarks – connected bridgeless cubic graphs that cannot be 3edge-coloured – is well-known as a potential source of counterexamples to several important and long-standing conjectures in graph theory. These include the cycle double cover conjecture, Tutte’s 5-flow conjecture, Fulkerson’s conjecture, and several others. One way of approaching these conjectures is through the study of ...

Here we study the normalized Laplacian characteristics polynomial (L-polynomial) for trees and specifically for starlike trees. We describe how the L-polynomial of a tree depends on some topological indices. For which, we also define the higher order general Randić indices for matching and which are different from higher order connectivity indices. Finally we provide the multiplicity of the eig...

If $G$ is a connected graph with vertex set $V$, then the eccentric connectivity index of $G$, $xi^c(G)$, is defined as $sum_{vin V(G)}deg(v)ecc(v)$ where $deg(v)$ is the degree of a vertex $v$ and $ecc(v)$ is its eccentricity. In this paper we show some convergence in probability and an asymptotic normality based on this index in random bucket recursive trees.

In this paper, we show that in the class of connected graphs G of order n ≥ 3 having girth at least equal to k, 3 ≤ k ≤ n, the unique graph G having minimum general sum-connectivity index χα(G) consists of Ck and n−k pendant vertices adjacent to a unique vertex of Ck, if−1 ≤ α < 0. This property does not hold for zeroth-order general Randić index Rα(G).

BACKGROUND Synthesizing and characterizing aptamers with high affinity and specificity have been extensively carried out for analytical and biomedical applications. Few publications can be found that describe structure-activity relationships (SARs) of candidate aptamer sequences. METHODOLOGY This paper reports pattern recognition with support vector machine (SVM) classification techniques for...

The m-order connectivity index mχ(G) of a molecular graph G is the sum of the weights (di1di2 · · · dim+1) 1 2 , where di1di2 · · · dim+1 runs over all paths of length m in G and di denotes the degree of vertex vi. Dendrimer is a polimer molecule with a distinctive structure that resembles the crown of a tree. In this paper we compute second-order and third-order connectivity indices of an infi...

For a graph G, let σ(G) = ∑ uv∈E(G) 1 √ dG(u)+dG(v) ; this defines the sum-connectivity index σ(G). More generally, given a positive function t, the edge-weight t-index t(G) is given by t(G) = ∑ uv∈E(G) t(ω(uv)), where ω(uv) = dG(u) + dG(v). We consider extremal problems for the t-index over various families of graphs. The sum-connectivity index satisfies the conditions imposed on t in each ext...

Modelling of the critical micelle concentrations (cmc) using the molecular connectivity indices was performed for a set of 21 cationic gemini surfactants with medium-length spacers. The obtained model contains only the second-order Kier and Hall molecular connectivity index. It is suggested that the index 2χ includes some information about flexibility. The obtained model was used to predict log...