The zeroth-order general Randic index, 0R?(G), of a connected graph G, is defined as 0 P R?(G) = ni =1 d?i , where di the degree vertex vi G and ? arbitrary real number. We consider linear combinations 0R?(G) form (? + ?)0R??1(G) ?? 0R??2(G) 2a 0R??1(G) a2 0R??2(G), an number, determine their bounds. As corollaries, various upper lower bounds indices that represent some special cases are obtain...

for solving large sparse non-hermitian positive definite linear equations, bai et al. proposed the hermitian and skew-hermitian splitting methods (hss). they recently generalized this technique to the normal and skew-hermitian splitting methods (nss). in this paper, we present an accelerated normal and skew-hermitian splitting methods (anss) which involve two parameters for the nss iteration. w...

Let G = (V, E), V {v1, v2,..., vn}, be a simple connected graph of order n and size m, without isolated vertices. Denote by d1 ? d2 ?... dn, di d(vi) sequence vertex degrees G. The general zeroth-order Randic index is defined as 0R?(G) ?ni =1 d?i, where an arbitrary real number. corresponding coindex via 0R??(G) ?ni=1(n?1?di)d?i. Some new bounds for the relationship between 0R??(G?) 0R???1(G?) ...

let $g$ be a simple graph‎, ‎and $g^{sigma}$‎ ‎be an oriented graph of $g$ with the orientation ‎$sigma$ and skew-adjacency matrix $s(g^{sigma})$‎. ‎the $k-$th skew spectral‎ ‎moment of $g^{sigma}$‎, ‎denoted by‎ ‎$t_k(g^{sigma})$‎, ‎is defined as $sum_{i=1}^{n}( ‎‎‎lambda_{i})^{k}$‎, ‎where $lambda_{1}‎, ‎lambda_{2},cdots‎, ‎lambda_{n}$ are the eigenvalues of $g^{sigma}$‎. ‎suppose‎ ‎$g^{sigma...

in this paper an algorithm for computing the balaban and randic indices of any simple connected graph was introduced. also these indices were computed for ipr c80 fullerene isomers, zigzag nanotubes and graphene by gap program.

it is necessary to generate the automorphism group of a chemical graph in computer-aidedstructure elucidation. an euclidean graph associated with a molecule is defined by a weightedgraph with adjacency matrix m = [dij], where for i≠j, dij is the euclidean distance between thenuclei i and j. in this matrix dii can be taken as zero if all the nuclei are equivalent. otherwise,one may introduce dif...

Structure-preserving discretization of the Rosenbluth–Fokker–Planck equation is still an open question especially for unlike-particle collision. In this paper, a mass-energy-conserving isotropic scheme introduced. The structure related to energy conservation skew-symmetry in mathematical sense, and action–reaction law physical sense. A thermal relaxation term obtained by using integration-by-pa...