Skip to main content
SpringerLink
Log in

Enumeration of Unlabelled Mating Graphs

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

The problem of enumeration of unlabelled mating graphs is solved by constructing a bijection between the class of unlabelled mating graphs and the class of unlabelled graphs without endpoints.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Harary, F.: Graph Theory, Addison-Wesley, 1969

  2. Harary, F., Palmer, E.M.: Graphical Enumeration, Academic Press, 1973

  3. McKay, B.: Program Nauty for computing automorphism groups of graphs, http://cs.anu.edu.au/people/bdm/nauty

  4. Read, R.C.: The Enumeration of Mating-Type Graphs. Report CORR 89–38, Dept. Combinatorics and Optimatization, Univ. Waterloo, Oct. 1989

  5. Robinson, R.W.: Enumeration of non-separable graphs, J. Combin. Theory 9 (1970), 327–356

    Google Scholar 

  6. Sloane, N.J.A.: On-Line Encyclopedia of Integer Sequences, http://www.research.att.com/~njas/sequences/

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Faculty of Technology and Metallurgy, University of Belgrade, 4 Karnegijeva St, 11001, Belgrade, Serbia

    Goran Kilibarda

Authors
  1. Goran Kilibarda
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Goran Kilibarda.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kilibarda, G. Enumeration of Unlabelled Mating Graphs. Graphs and Combinatorics 23, 183–199 (2007). https://doi.org/10.1007/s00373-007-0692-5

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-007-0692-5

Keywords

Search

Navigation