In this paper, we evaluate the uniqueness of several information-theoretic measures for graphs based on so-called information functionals and compare the results with other information indices and non-information-theoretic measures such as the well-known Balaban J index. We show that, by employing an information functional based on degree-degree associations, the resulting information index out...

the padmakar-ivan (pi) index is a first-generation topological index (ti) based on sums overall edges between numbers of edges closer to one endpoint and numbers of edges closer to theother endpoint. edges at equal distances from the two endpoints are ignored. an analogousdefinition is valid for the wiener index w, with the difference that sums are replaced byproducts. a few other tis are discu...

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.

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

Abstract This work presents a simple method for partitioning the bond‐additive and atoms‐pair‐additive distance‐based topological indices of plane graphs into sum contributions inner faces. The proposed is applied to decompose several (Wiener, hyper‐Wiener, Tratch‐Stankevich‐Zefirov, Balaban, Szeged indices) ring series benzenoid systems. It was found that employed scheme providing an accurate ...

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

We introduce a novel predictive statistical modeling technique called Hybrid Radial Basis Function Neural Networks (HRBF-NN) as a forecaster. HRBF-NN is a flexible forecasting technique that integrates regression trees, ridge regression, with radial basis function (RBF) neural networks (NN). We develop a new computational procedure using model selection based on information-theoretic principles...

Let G be a nonempty simple graph with vertex set V(G) and an edge E(G). For every injective labeling f:V(G)?Z, there are two induced labelings, namely f+:E(G)?Z defined by f+(uv)=f(u)+f(v), f?:E(G)?Z f?(uv)=|f(u)?f(v)|. The sum index the difference minimum cardinalities of ranges f+ f?, respectively. We provide upper lower bounds on index, determine various families graphs. also interesting con...

let $a$ be a non-trivial abelian group and $a^{*}=asetminus {0}$. a graph $g$ is said to be $a$-magic graph if there exists a labeling$l:e(g)rightarrow a^{*}$ such that the induced vertex labeling$l^{+}:v(g)rightarrow a$, define by $$l^+(v)=sum_{uvin e(g)} l(uv)$$ is a constant map.the set of all constant integerssuch that $sum_{uin n(v)} l(uv)=c$, for each $vin n(v)$,where $n(v)$ denotes the s...