Volume 5, Supplement 1

 

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

  • Relation Between Wiener, Szeged and Detour Indices 

    GHORBANI, mojtab؛ Roumena, Mohaddeseh؛ Ghorbani, Modjtaba (University of Kashan, 2014-12-01)
    In theoretical chemistry, molecular structure descriptors are used to compute properties of chemical compounds. Among them Wiener, Szeged and detour indices play significant roles in anticipating chemical phenomena. In the ...

  • The Center and Periphery of Composite Graphs 

    Yarahmadi, Zahra؛ Moradi, Sirous (University of Kashan, 2014-12-01)
    The center (periphery) of a graph is the set of vertices with minimum (maximum) eccentricity. In this paper, the structure of centers and peripheries of some classes of composite graphs are determined. The relations between ...

  • The Laplacian Polynomial and Kirchhoff Index of the k-th‎ Semi Total Point Graphs 

    mehranian, zeinab (University of Kashan, 2014-12-01)
    The k-th semi total point graph of a graph G, , ‎is a graph‎ obtained from G by adding k vertices corresponding to each edge and‎ connecting them to the endpoints of edge considered‎. ‎In this paper‎, a formula for Laplacian ...

  • The Neighbourhood Polynomial of some Nanostructures 

    Alikhani, Saeid؛ Mahmoudi, Eisa (University of Kashan, 2014-12-01)
    The neighbourhood polynomial G , is generating function for the number of faces of each cardinality in the neighbourhood complex of a graph. In other word $N(G,x)=sum_{Uin N(G)} x^{|U|}$, where N(G) is neighbourhood complex ...

  • The First Geometric–Arithmetic Index of Some Nanostar Dendrimers 

    Madanshekaf, Ali؛ Moradi, M. (University of Kashan, 2014-12-01)
    Dendrimers are highly branched organic macromolecules with successive layers or generations of branch units surrounding a central core [1 ,4 ]. These are key molecules in nanotechnology and can be put to good use. In this ...

  • Perfect Matchings in Edge-Transitive Graphs 

    Marandi, A.؛ Nejah, A.؛ Behmaram, Afshin (University of Kashan, 2014-12-01)
    We find recursive formulae for the number of perfect matchings in a graph G by splitting G into subgraphs H and Q. We use these formulas to count perfect matching of P hypercube Qn. We also apply our formulas to prove that ...

  • Flow Polynomial of some Dendrimers 

    Sharifi, Hasan؛ Fath-Tabar, Gholam Hossein (University of Kashan, 2014-12-01)
    Suppose G is an nvertex and medge simple graph with edge set E(G). An integervalued function f: E(G) → Z is called a flow. Tutte was introduced the flow polynomial F(G, λ) as a polynomial in an indeterminate λ with integer ...