Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

DM
2007

favoriteEmaildiscussreport

113views more DM 2007»

Counting labeled general cubic graphs

13 years 4 months ago

Counting labeled general cubic graphs

Download www.cs.uga.edu

Recurrence relations are derived for the numbers of labeled 3-regular graphs with given connectivity, order, number of double edges, and number of loops. This work builds on methods previously developed by Read, Wormald, Palmer, and Robinson. © 2007 Elsevier B.V. All rights reserved. MSC: 05A15

Gab-Byung Chae, Edgar M. Palmer, Robert W. Robinso

Real-time Traffic

3-regular Graphs | DM 2007 | Double Edges | Recurrence Relations |

claim paper

Related Content

» Counting ClawFree Cubic Graphs

» The independence number in graphs of maximum degree three

» Approximately Counting Embeddings into Random Graphs

» Compact Labelings For Efficient FirstOrder ModelChecking

» Graph based topological analysis of tessellated surfaces

» Extraction and classification of dense communities in the web

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2007
Where	DM
Authors	Gab-Byung Chae, Edgar M. Palmer, Robert W. Robinson

Comments (0)