Skip to main content Skip to main navigation menu Skip to site footer
Proceeding Series of the Brazilian Society of Computational and Applied Mathematics
  • About
  • Editorial Team
  • Current
  • Archives
  • Contact
Search
  • Login
  1. Home /
  2. Archives /
  3. Vol. 3 No. 1 (2015): CNMAC 2014 /
  4. Matemática Discreta

Counting cycles in strongly connected graphs

Authors

  • G. A. T. F. da Costa

DOI:

https://doi.org/10.5540/03.2015.003.01.0230

Keywords:

Counting, Cycles, Strongly Connected Graphs

Abstract

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

Download data is not yet available.

Downloads

  • PDF (Português (Brasil))

Published

2015-08-25

Issue

Vol. 3 No. 1 (2015): CNMAC 2014

Section

Matemática Discreta

issn

e-ISSN: 2359-0793

Language
  •   English
  •   Español (España)
  •   Português (Brasil)

Developed By

Open Journal Systems
More information about the publishing system, Platform and Workflow by OJS/PKP.