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 general Randić index Rα(G) of a (chemical) graph G, is defined as the sum of the weights (d(u)d(v))α of all edges uv of G, where d(u) denotes the degree of a vertex u in G and α an arbitrary real number, which is called the Randić index or connectivity index (or branching index) for α = −1/2 proposed by Milan Randić in 1975. The paper outlines the results known for the (general) Randić inde...

let g be a connected simple (molecular) graph. the distance d(u, v) between two vertices u and v of g is equal to the length of a shortest path that connects u and v. in this paper we compute some distance based topological indices of h-phenylenic nanotorus. at first we obtain an exactformula for the wiener index. as application we calculate the schultz index and modified schultz index of this ...

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).

This paper surveys extremal properties of general sum-connectivity index χα(G) in several classes of connected graphs of given order for some values of the parameter α: a) trees; b) connected unicyclic or bicyclic graphs; c) graphs of given connectivity. Work presented as invited lecture at CAIM 2014, September 19-22, “Vasile Alecsandri” University of Bacău, Romania.

Let [Formula: see text] be a commutative Noetherian ring. For finitely generated text]-module text], Northcott introduced the reducibility index of which is number submodules appearing in an irredundant irreducible decomposition submodule text]. On other hand, for Artinian Macdonald proved that sum-irreducible representation does not depend on choice representation. This called sum-reducibility...

Abstract We consider two recent conjectures made by Harrington, Henninger-Voss, Karhadkar, Robinson and Wong concerning relationships between the sum index, difference index exclusive number of graphs. One conjecture posits an exact relationship first invariants; we show that in fact predicted value may be arbitrarily far from truth either direction. In process establish some new bounds on both...