Mohammad Ali Salahshour - Department of Science, Islamic Azad University, Savadkooh Branch, Savadkooh, Mazandaran, I. R. Iran

Let G be a simple connected graph. The vertex PI polynomial of G is defined as PIv(G ,x )=Σe=uv Xnu(e)+nv(e) here nu(e) is the number of vertices closer to u than v and nv(e) is the number of vertices closer to v than u. The PI polynomial of G is defined as  PI(G ,x )=Σe=uv Xmu(e)+mv(e) , where mu(e) is the number of edges closer to u than v and mv(e) is the number of edges closer to v than u. In this paper, the PI and vertex PI polynomials of two types of dendrimers are computed.

PI polynomial, vertex PI polynomial, Szeged index