Advanced search
1 file | 283.36 KB

Generation of cubic graphs

Author
Organization
Project
HPC-UGent: the central High Performance Computing infrastructure of Ghent University
Abstract
We describe a new algorithm for the efficient generation of all non-isomorphic connected cubic graphs. Our implementation of this algorithm is more than 4 times faster than previous generators. The generation can also be efficiently restricted to cubic graphs with girth at least 4 or 5.
Keywords
canonical construction path, generation, graph, cubic graph

Downloads

  • 1801-6352-1-PB.pdf
    • full text
    • |
    • open access
    • |
    • PDF
    • |
    • 283.36 KB

Citation

Please use this url to cite or link to this publication:

Chicago
Brinkmann, Gunnar, Jan Goedgebeur, and Brendan D McKay. 2011. “Generation of Cubic Graphs.” Discrete Mathematics and Theoretical Computer Science 13 (2): 69–80.
APA
Brinkmann, Gunnar, Goedgebeur, J., & McKay, B. D. (2011). Generation of cubic graphs. DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 13(2), 69–80.
Vancouver
1.
Brinkmann G, Goedgebeur J, McKay BD. Generation of cubic graphs. DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE. 2011;13(2):69–80.
MLA
Brinkmann, Gunnar, Jan Goedgebeur, and Brendan D McKay. “Generation of Cubic Graphs.” DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE 13.2 (2011): 69–80. Print.
@article{1973882,
  abstract     = {We describe a new algorithm for the efficient generation of all non-isomorphic connected cubic graphs. Our implementation of this algorithm is more than 4 times faster than previous generators. The generation can also be efficiently restricted to cubic graphs with girth at least 4 or 5.},
  author       = {Brinkmann, Gunnar and Goedgebeur, Jan and McKay, Brendan D},
  issn         = {1365-8050},
  journal      = {DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE},
  keyword      = {canonical construction path,generation,graph,cubic graph},
  language     = {eng},
  number       = {2},
  pages        = {69--80},
  title        = {Generation of cubic graphs},
  volume       = {13},
  year         = {2011},
}

Web of Science
Times cited: