Counting cycles in strongly connected graphs Autores G. A. T. F. da Costa DOI: https://doi.org/10.5540/03.2015.003.01.0230 Palavras-chave: Counting, Cycles, Strongly Connected Graphs Resumo In this short presentation I give a formula for counting cycles of a given length in strongly connected graphs and some of its properties. Downloads Downloads PDF Publicado 2015-08-25 Edição v. 3 n. 1 (2015): CNMAC 2014 Seção Matemática Discreta