(2)-pancyclic graphs

Authors:
Carol T. Zamfirescu
Affiliations:
-
Venue:
Discrete Applied Mathematics
Year:
2013

Citing 5
Cited 0

Some theorems of uniquely pancyclic graphs

Discrete Mathematics
On maximum cycle-distributed graphs

Discrete Mathematics
On the size of graphs with all cycle having distinct length

Discrete Mathematics
Covering non-uniform hypergraphs

Journal of Combinatorial Theory Series B
Note on graphs without repeated cycle lengths

Journal of Graph Theory

Quantified Score

Hi-index	0.04

Visualization

Abstract

We introduce the class of (2)-pancyclic graphs, which are simple undirected finite connected graphs of order n having exactly two cycles of length p for each p satisfying 3@?p@?n, analyze their properties, and give several examples of such graphs, among which are the smallest.