Generating r-regular graphs

Authors:
Guoli Ding;Peter Chen
Affiliations:
Mathematics Department, Louisiana State University, Baton Rouge, Louisiana;Computer Science Department, Louisiana State University, Baton Rouge, Louisiana
Venue:
Discrete Applied Mathematics
Year:
2003

Citing 5
Cited 1

Edge reductions in cyclically k-connected cubic graphs

Journal of Combinatorial Theory Series B
Generating all 3-connected 4-regular planar graphs from the octahedron graph

Journal of Graph Theory
Note on irreducible triangulations of surfaces

Journal of Graph Theory
Irreducible quadrangulations of the torus

Journal of Combinatorial Theory Series B
Generating quadrangulations of surfaces with minimum degree at least 3

Journal of Graph Theory

A note on the complexity of rooted trees and hierarchies with possible applications to organization design and system architectures

MATH'05 Proceedings of the 8th WSEAS International Conference on Applied Mathematics

Quantified Score

Hi-index	0.04

Visualization

Abstract

For each nonnegative integer r, we determine a set of graph operations such that all r-regular loopless graphs can be generated from the smallest r-regular loopless graphs by using these operations. We also discuss possible extensions of this result to r-regular graphs of girth at least g, for each fixed g.