Dehmer, Matthias, Chen, Zengqiang, Emmert-Streib, Frank, Tripathi, Shailesh, Mowshowitz, Abbe, Levitchi, Alexei, Feng, Lihua, Shi, Yongtang, Tao, Jin, and Sendiña-Nadal, Irene. Measuring the complexity of directed graphs: A polynomial-based approach. Retrieved from https://par.nsf.gov/biblio/10165220. PLOS ONE 14.11 Web. doi:10.1371/journal.pone.0223745.

Dehmer, Matthias, Chen, Zengqiang, Emmert-Streib, Frank, Tripathi, Shailesh, Mowshowitz, Abbe, Levitchi, Alexei, Feng, Lihua, Shi, Yongtang, Tao, Jin, & Sendiña-Nadal, Irene. Measuring the complexity of directed graphs: A polynomial-based approach. PLOS ONE, 14 (11). Retrieved from https://par.nsf.gov/biblio/10165220. https://doi.org/10.1371/journal.pone.0223745

Dehmer, Matthias, Chen, Zengqiang, Emmert-Streib, Frank, Tripathi, Shailesh, Mowshowitz, Abbe, Levitchi, Alexei, Feng, Lihua, Shi, Yongtang, Tao, Jin, and Sendiña-Nadal, Irene. "Measuring the complexity of directed graphs: A polynomial-based approach". PLOS ONE 14 (11). Country unknown/Code not available. https://doi.org/10.1371/journal.pone.0223745. https://par.nsf.gov/biblio/10165220.

@article{osti_10165220,
place = {Country unknown/Code not available}, title = {Measuring the complexity of directed graphs: A polynomial-based approach}, url = {https://par.nsf.gov/biblio/10165220}, DOI = {10.1371/journal.pone.0223745}, abstractNote = {}, journal = {PLOS ONE}, volume = {14}, number = {11}, author = {Dehmer, Matthias and Chen, Zengqiang and Emmert-Streib, Frank and Tripathi, Shailesh and Mowshowitz, Abbe and Levitchi, Alexei and Feng, Lihua and Shi, Yongtang and Tao, Jin and Sendiña-Nadal, Irene}, }