Answers are grounded in this paper and cite their sources.
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) = sumile j 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.
No takes yet. Share an insight, caveat, or question.
Deutsch et al. (2015) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: