Ali Iranmanesh

Learn More
The Narumi-Katayama index of a graph G, denoted by NK(G), is equal to the product of the degrees of the vertices of G. In this paper we compute this index for Splice and Link of two graphs. At least with use of Link of two graphs, we compute this index for a class of dendrimers. With this method, the NK index for other class of dendrimers can be computed(More)
In this paper, a novel 3D graphical representation of DNA sequence based on codons is proposed. Since there is not loss of information due to overlapping and containing loops, this representation will be useful for comparison of different DNA sequences. This 3D curve will be convenient for DNA mutations comparison specially. In continues we give a numerical(More)
One important task in the study of genome sequences and mutations is to determine densities of specific nucleotides and codons. The graphical representation of DNA sequences provide a simple way of viewing, storing, and comparing various sequences. In this paper, we first present for each kind of codon, a numerically representation as a 2D coordinate (x,y)(More)
The multiplicative sum Zagreb index is defined for a simple graph G as the product of the terms d G (u)+d G (v) over all edges uv ∈ E(G) , where d G (u) denotes the degree of the vertex u of G. In this paper, we present some lower bounds for the multiplicative sum Zagreb index of several graph operations such as union, join, corona product, composition,(More)
Polynomial interpolation can be used to obtain closed formulas for topological indices of infinite series of molecular graphs. The method is discussed and its advantages and limitations are pointed out. This is illustrated on fullerenes C 12k+4 and four topological indices: the Wiener index, the edge Wiener index, the eccentric connectivity index, and the(More)