| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 418378 | Discrete Applied Mathematics | 2013 | 9 Pages |
Abstract
We introduce the class of (2)-pancyclic graphs, which are simple undirected finite connected graphs of order nn having exactly two cycles of length pp for each pp satisfying 3≤p≤n3≤p≤n, analyze their properties, and give several examples of such graphs, among which are the smallest.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Carol T. Zamfirescu,