Key points are not available for this paper at this time.
Let G be a graph and let m₈₉ (G), i, jge 1, be the number of edges uv of G such that dᵥ (G), dᵤ (G) = i, j. The em M-polynomial of G is introduced with displaystyleM (G;x, y) = sum₈₋₄ ₉ m₈₉ (G) xⁱyʲ. 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 et al. (2015) studied this question.