B. Manoochehrian

Learn More
Let G be a connected graph, u; v be vertices of G and e = uv. The number of edges of G lying closer to u than to v is denoted by n eu (e|G) and the number of edges of G lying closer to v than to u is denoted by n ev (e|G). The PI polynomial of G is defined as PI(G; x) = N(u,v) {u,v} V(G) x , ⊆ ∑ where N(u,v) = n eu (e|G) + n ev (e|G), if e = uv; and = 0,(More)
  • 1