APA (7th ed.) Citation

Jayakumar, R., Thulasiraman, K., & Swamy, M. (1984). Complexity of computation of a spanning tree enumeration algorithm. IEEE transactions on circuits and systems, 31(10), 853-860. https://doi.org/10.1109/TCS.1984.1085435

Chicago Style (17th ed.) Citation

Jayakumar, R., K. Thulasiraman, and M. Swamy. "Complexity of Computation of a Spanning Tree Enumeration Algorithm." IEEE Transactions on Circuits and Systems 31, no. 10 (1984): 853-860. https://doi.org/10.1109/TCS.1984.1085435.

MLA (9th ed.) Citation

Jayakumar, R., et al. "Complexity of Computation of a Spanning Tree Enumeration Algorithm." IEEE Transactions on Circuits and Systems, vol. 31, no. 10, 1984, pp. 853-860, https://doi.org/10.1109/TCS.1984.1085435.