[PDF][PDF] Wiener polynomial and degree distance polynomial of some graphs
DA JEYANTHI, TM SELVARAJAN - research-publication.com
The Wiener polynomial of a graph G is W (G, x)=∑ i< j xd (vi, vj), where d (vi, vj) is the
shortest path between the vertices vi and vj. The Degree distance polynomial of a graph G is …
shortest path between the vertices vi and vj. The Degree distance polynomial of a graph G is …
[PDF][PDF] WIENER POLYNOMIAL AND DEGREE DISTANCE POLYNOMIAL OF SOME GRAPHS
DA JEYANTHI, TM SELVARAJAN - research-publication.com
The Wiener polynomial of a graph G is W (G, x)=∑ i< j xd (vi, vj), where d (vi, vj) is the
shortest path between the vertices vi and vj. The Degree distance polynomial of a graph G is …
shortest path between the vertices vi and vj. The Degree distance polynomial of a graph G is …