Cite
HARVARD Citation
Kincaid, R. et al. (2016). Algorithms and complexity results for finding graphs with extremal Randić index. Networks. 67 (4), pp. 338-347. [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Kincaid, R. et al. (2016). Algorithms and complexity results for finding graphs with extremal Randić index. Networks. 67 (4), pp. 338-347. [Online].