Title of article
Counting labeled claw-free cubic graphs by connectivity Original Research Article
Author/Authors
Gab-Byung Chae، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2008
Pages
8
From page
5136
To page
5143
Abstract
Claw-free cubic graphs are counted with given connectedness and order. Tables are provided for claw-free cubic graphs with given connectedness. This builds on methods for counting general cubic graphs by connectivity previously developed by Chae, Palmer, and Robinson, and on the earlier enumeration of all claw-free cubic graphs by McKay, Palmer, Read, and Robinson.
Keywords
Claw-free graphs , Labeled enumeration , Exponential generating functions , Recurrence relations , General cubic graphs
Journal title
Discrete Mathematics
Serial Year
2008
Journal title
Discrete Mathematics
Record number
947133
Link To Document