Maximum number of cycles in graphs and multigraphs
No Thumbnail Available
Date
2016
Authors
Arman, Andrii
Journal Title
Journal ISSN
Volume Title
Publisher
Elsevier
Abstract
In this thesis a problem of determining the maximum number of cycles for the following classes of graphs is considered: triangle-free graphs; K_r-free graphs; graphs with m edges; graphs with n vertices and m edges; multigraphs with m edges and multigraphs with n vertices and m edges.
Description
Keywords
Graph Theory, Cycles
Citation
A. Arman, D. Gunderson, and S. Tsaturian, Triangle-free graphs with the maximum number of cycles, Discrete Math. 339 (2016), 699--711