Volume 3, Supplement 1


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

  • Computing Chemical Properties of Molecules by Graphs and Rank Polynomials 

    MOGHARRAB, M.؛ FATH-TABAR, G. (University of Kashan, 2012-12-01)
    The topological index of a graph G is a numeric quantity related to G which is invariant under automorphisms of G. The Tutte polynomial of 􀜩 is a polynomial in two variables defined for every undirected graph contains ...

  • On Counting Polynomials of Some Nanostructures 

    GHORBANI, M.؛ SONGHORI, M. (University of Kashan, 2012-12-01)
    The Omega polynomial(x) was recently proposed by Diudea, based on the length of strips in given graph G. The Sadhana polynomial has been defined to evaluate the Sadhana index of a molecular graph. The PI polynomial is ...

  • A Note on Atom Bond Connectivity Index 

    HEIDARI RAD, S.؛ KHAKI, A. (University of Kashan, 2012-12-01)
    The atom bond connectivity index of a graph is a new topological index was defined by E. Estrada as ABC(G)  uvE (dG(u) dG(v) 2) / dG(u)dG(v) , where G d ( u ) denotes degree of vertex u. In this paper we present some ...

  • On Symmetry of Some Nano Structures 

    GHORBANI, M.؛ ZAEEMBASHI, A.؛ SHAHREZAEI, M.؛ TABATABAEI ADNANI, A. (University of Kashan, 2012-12-01)
    It is necessary to generate the automorphism group of a chemical graph in computer-aided structure elucidation. An Euclidean graph associated with a molecule is defined by a weighted graph with adjacency matrix M = [dij], ...

  • Geometric-Arithmetic Index of Hamiltonian Fullerenes 

    MOSTAFAEI, H.؛ ZAEEMBASHI, A.؛ OSTAD RAHIMI, M. (University of Kashan, 2012-12-01)
    A graph that contains a Hamiltonian cycle is called a Hamiltonian graph. In this paper we compute the first and the second geometric – arithmetic indices of Hamiltonian graphs. Then we apply our results to obtain some ...

  • Eccentric Connectivity Index of Some Dendrimer Graphs 

    GHORBANI, M.؛ MALEKJANI, KH.؛ KHAKI, A. (University of Kashan, 2012-12-01)
    The eccentricity connectivity index of a molecular graph G is defined as (G) = aV(G) deg(a)ε(a), where ε(a) is defined as the length of a maximal path connecting a to other vertices of G and deg(a) is degree of vertex ...

  • Computing GA4 Index of Some Graph Operations 

    SAHELI, M.؛ JALALI RAD, M. (University of Kashan, 2012-12-01)
    The geometric-arithmetic index is another topological index was defined as 2 deg ( )deg ( ) ( ) deg ( ) deg ( ) G G uv E G G u v GA G u v     , in which degree of vertex u denoted by degG (u). We now define a new version ...

  • Applications of Graph Operations 

    TAVAKOLI, M.؛ RAHBARNIA, F. (University of Kashan, 2012-12-01)
    In this paper, some applications of our earlier results in working with chemical graphs are presented.

  • Note on Properties of First Zagreb Index of Graphs 

    TAVAKOLI, M.؛ RAHBARNIA, F. (University of Kashan, 2012-12-01)
    Let G be a graph. The first Zagreb M1(G) of graph G is defined as: M1(G) = uV(G) deg(u)2. In this paper, we prove that each even number except 4 and 8 is a first Zagreb index of a caterpillar. Also, we show that the fist ...