Paper Info
Title
(2)-pancyclic graphs
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.
Year
DOI
Venue
2013
10.1016/j.dam.2012.11.002
Discrete Applied Mathematics
Keywords
Field
DocType
order n,pancyclic graph,undirected finite connected graph,length p
Discrete mathematics,Modular decomposition,Indifference graph,Combinatorics,Chordal graph,Clique-sum,Graph product,Pancyclic graph,Mathematics,Trapezoid graph,Maximal independent set
Journal
Volume
Issue
Citations 
161
7-8
0
PageRank 
References 
Authors
0.34
6
1
Name
Order
Citations
PageRank
Carol T. Zamfirescu13815.25