Genetic Theory for Cubic Graphs

Part of the SpringerBriefs in Operations Research book series (BRIEFSOPERAT)


We partition the set of unlabelled cubic graphs into two disjoint sets, namely “genes” and “descendants”, where the distinction lies in the absence or presence, respectively, of special edge cutsets. We introduce three special operations called breeding operations which accept, as input, two graphs, and output a new graph. The new graph inherits most of the structure of both the input graphs, and so we refer to the input graphs as parents and the output graph as a child. We also introduce three more operations called parthenogenic operations which accept a single descendant as input, and output a slightly more complicated descendant. We prove that every descendant can be constructed from a family of genes via the use of our six operations, and state the result (to be proved in Chap. 3) that this family is unique for any given descendant.


Breeding Operations Descendant Graph Original Descendants Countably Infinite Sequence Ladder Graphs 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Balaban, A.T., Harary, F.: The characteristic polynomial does not uniquely determine the topology of a molecule. J. Chem. Doc. 11, 258–259 (1971)CrossRefGoogle Scholar
  2. 2.
    Barnette, D.: Recent progress in combinatorics. In: Tutte, W.T. (ed.) Proceedings of the Third Waterloo Conference on Combinatorics, May 1968. Academic, New York (1969)Google Scholar
  3. 3.
    Batagelj, V.: Inductive classes of graphs. In: Proceedings of the Sixth Yugoslav Seminar on Graph Theory, Dubrovnik, 1985, pp. 43–56 (1986)Google Scholar
  4. 4.
    Blanus̆a, D.: Problem cetiriju boja. Glasnik Mat. Fiz. Astr. Ser. II 1, 31–42 (1946)Google Scholar
  5. 5.
    Brinkmann, G.: Fast generation of cubic graphs. J. Graph Theory 23, 139–149 (1996)CrossRefGoogle Scholar
  6. 6.
    Brinkmann, G., Goedgebeur, J., McKay, B.D.: Generation of cubic graphs. Discret. Math. Theor. Comput. Sci. 13(2), 69–80 (2011)Google Scholar
  7. 7.
    Ding, G., Kanno, J.: Splitter theorems from cubic graphs. Comb. Probab. Comput. 15, 355–375 (2006)CrossRefGoogle Scholar
  8. 8.
    Eppstein, D.: The traveling salesman problem for cubic graphs. In: Dehne, F., Sack, J-R., Smid, M. (eds.) Algorithms and Data Structures. Volume 2748 of Lecture Notes in Computer Science, pp. 307–318. Springer, Heidelberg (2003)Google Scholar
  9. 9.
    Filar, J.A., Haythorpe, M., Nguyen, G.T.: A conjecture on the prevalence of cubic bridge graphs. Discuss. Math. Graph Theory 30(1), 175–179 (2010)CrossRefGoogle Scholar
  10. 10.
    Guy, R.K., Harary, F.: On the Möbius ladders. Can. Math. Bull. 10, 493–496 (1967)CrossRefGoogle Scholar
  11. 11.
    Harary, F.: Graph Theory. Addison-Wesley, Reading (1969)Google Scholar
  12. 12.
    Holton, D.A., Sheehan, J.: The Petersen Graph. Cambridge University Press, Cambridge (1993)CrossRefGoogle Scholar
  13. 13.
    Isaacs, R.: Infinite Families of Nontrivial Trivalent Graphs Which Are Not Tait Colorable. Am. Math. Mon. 82, 221–239 (1975)CrossRefGoogle Scholar
  14. 14.
    Lou, D., Teng, L., Wu, X.: A polynomial algorithm for cyclic edge connectivity of cubic graphs. Australas. J. Comb. 24, 247–259 (2001)Google Scholar
  15. 15.
    McKay, B.D., Royle, G.F.: Constructing the cubic graphs on up to 20 vertices. Ars Comb. 12A, 129–140 (1986)Google Scholar
  16. 16.
    Meringer, M.: Fast generation of regular graphs and construction of cages. J. Graph Theory 30, 137–146 (1999)CrossRefGoogle Scholar
  17. 17.
    Ore, O.: The Four-Colour Problem. Academic, New York (1967)Google Scholar
  18. 18.
    Read, R.C., Wilson, R.J.: An Atlas of Graphs, p. 263. Oxford University Press, Oxford (1998)Google Scholar
  19. 19.
    Royle, G.: Constructive enumeration of graphs. Ph.D. thesis, University of Western Australia (1987)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  1. 1.School of CSEMFlinders UniversityBedford ParkAustralia

Personalised recommendations