Counting cycles in strongly connected graphs

Autores/as

  • G. A. T. F. da Costa

DOI:

https://doi.org/10.5540/03.2015.003.01.0230

Palabras clave:

Counting, Cycles, Strongly Connected Graphs

Resumen

In this short presentation I give a formula for counting cycles of a given length in strongly connected graphs and some of its properties.

Descargas

Los datos de descargas todavía no están disponibles.

Publicado

2015-08-25

Número

Sección

Matemática Discreta