Volume 3, Issue 2

 

ارسال های اخیر

  • On multiplicative Zagreb indices of graphs 

    IRANMANESH, A.؛ HOSSEINZADEH, M.؛ GUTMAN, I. (University of Kashan, 2012-09-01)
    Todeschini et al. have recently suggested to consider multiplicative variants of additive graph invariants, which applied to the Zagreb indices would lead to the multiplicative Zagreb indices of a graph G, denoted by ( ) ...

  • Fourth-order numerical solution of a fractional PDE with the nonlinear source term in the electroanalytical chemistry 

    ABBASZADE, M.؛ Mohebbi, M. (University of Kashan, 2012-09-01)
    The aim of this paper is to study the high order difference scheme for the solution of a fractional partial differential equation (PDE) in the electroanalytical chemistry. The space fractional derivative is described in ...

  • Wiener, Szeged and vertex PI indices of regular tessellations 

    MANUEL, P.؛ RAJASINGH, I.؛ AROCKIARAJ, M. (University of Kashan, 2012-09-01)
    A lot of research and various techniques have been devoted for finding the topological descriptor Wiener index, but most of them deal with only particular cases. There exist three regular plane tessellations, composed of ...

  • Fourth order and fourth sum connectivity indices of tetrathiafulvalene dendrimers 

    HASNI, R.؛ ARIF, N. (University of Kashan, 2012-09-01)
    The m-order connectivity index (G) m of a graph G is     1 2 1 1 2 1 ... ... 1 ( ) i i im m v v v i i i m d d d  G where 1 2 1 ... i i im d d d  runs over all paths of length m in G and i d denotes the degree of ...

  • A zero one programming model for RNA structures with arclength ≥ 4 

    SHIRDEL, G.؛ KAHKESHANI, N. (University of Kashan, 2012-09-01)
    In this paper, we consider RNA structures with arc-length 4 . First, we represent these structures as matrix models and zero-one linearprogramming problems. Then, we obtain an optimal solution for this problemusing an ...

  • Chromatic polynomials of some nanostars 

    ALIKHANI, S.؛ IRANMANESH, M. (University of Kashan, 2012-09-01)
    Let G be a simple graph and (G,) denotes the number of proper vertex colourings of G with at most  colours, which is for a fixed graph G , a polynomial in  , which is called the chromatic polynomial of G . Using the ...

  • Computational and electrochemical studies on the redox reaction of 2-(2,3-dihydroxy phenyl)-1,3- dithiane in aqueous solution 

    MAZLOUM-ARDAKANI, M.؛ BEITOLLAHI, H.؛ FARROKHPOUR, H.؛ KHOSHROO, A. (University of Kashan, 2012-09-01)
    Electrode potential of 2-(2,3-dihydroxy phenyl)-1,3-dithiane (DPD) was investigated by means of cyclic voltammetry (CV) at various potential scan rates. The calculated value was compared with the experimental value obtained ...

  • On discriminativity of vertex-degree-based indices 

    GUTMAN, I. (University of Kashan, 2012-09-01)
    A recently published paper [T. Došlić, this journal 3 (2012) 25-34] considers the Zagreb indices of benzenoid systems, and points out their low discriminativity. We show that analogous results hold for a variety of ...

  • On the tutte polynomial of benzenoid chains 

    FATH-TABAR, G.؛ GHOLAM-REZAEI, Z.؛ ASHRAFI, A. (University of Kashan, 2012-09-01)
    The Tutte polynomial of a graph G, T(G, x,y) is a polynomial in two variables defined for every undirected graph contains information about how the graph is connected. In this paper a simple formula for computing Tutte ...

  • Computing Wiener and hyper–Wiener indices of unitary Cayley graphs 

    LOGHMAN, A. (University of Kashan, 2012-09-01)
    The unitary Cayley graph Xn has vertex set Zn = {0, 1,…, n-1} and vertices u and v are adjacent, if gcd(uv, n) = 1. In [A. Ilić, The energy of unitary Cayley graphs, Linear Algebra Appl. 431 (2009) 1881–1889], the energy ...

  • Note on multiple Zagreb indices 

    GHORBANI, M.؛ AZIMI, N. (University of Kashan, 2012-09-01)
    The Zagreb indices are the oldest graph invariants used in mathematical chemistry to predict the chemical phenomena. In this paper we define the multiple versions of Zagreb indices based on degrees of vertices in a given ...