Let $G$ be a graph and let $m_{ij}(G)$, $i,jge 1$, be the number of edges $uv$ of $G$ such that ${d_v(G), d_u(G)} = {i,j}$. The {em $M$-polynomial} of $G$ is introduced with $displaystyle{M(G;x,y) = sum_{ile j} m_{ij}(G)x^iy^j}$. It is shown that degree-based topological indices can be routinely computed from the polynomial, thus reducing the problem of their determination in each particular case to the single problem of determining the $M$-polynomial. The new approach is also illustrated with examples.
Deutsch, E., & Klavžar, S. (2015). M-polynomial and Degree-based Topological Indices. Iranian Journal of Mathematical Chemistry, 6(2), 93-102. doi: 10.22052/ijmc.2015.10106
MLA
E. Deutsch; S. Klavžar. "M-polynomial and Degree-based Topological Indices". Iranian Journal of Mathematical Chemistry, 6, 2, 2015, 93-102. doi: 10.22052/ijmc.2015.10106
HARVARD
Deutsch, E., Klavžar, S. (2015). 'M-polynomial and Degree-based Topological Indices', Iranian Journal of Mathematical Chemistry, 6(2), pp. 93-102. doi: 10.22052/ijmc.2015.10106
VANCOUVER
Deutsch, E., Klavžar, S. M-polynomial and Degree-based Topological Indices. Iranian Journal of Mathematical Chemistry, 2015; 6(2): 93-102. doi: 10.22052/ijmc.2015.10106
)