(2)-pancyclic graphs

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.

Saved in:
Bibliographic Details
Published in:Discrete Applied Mathematics 2013-05, Vol.161 (7-8), p.1128-1136
Main Author: Zamfirescu, Carol T.
Format: Article
Language:English
Subjects:
Graphs
Mathematical analysis
Pancyclic graphs
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0166-218X
1872-6771
DOI:10.1016/j.dam.2012.11.002