Title of article
On cyclic edge-connectivity of fullerenes Original Research Article
Author/Authors
Klavdija Kutnar، نويسنده , , Dragan Maru?i?، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2008
Pages
9
From page
1661
To page
1669
Abstract
A graph is said to be cyclically k-edge-connected, if at least k edges must be removed to disconnect it into two components, each containing a cycle. Such a set of k edges is called a cyclic-k-edge cutset and it is called a trivial cyclic-k-edge cutset if at least one of the resulting two components induces a single
Keywords
Graph , Fullerene graph , Cyclic edge-connectivity , Hamilton cycle , Perfect matching
Journal title
Discrete Applied Mathematics
Serial Year
2008
Journal title
Discrete Applied Mathematics
Record number
886769
Link To Document