Skip to main content
SpringerLink
Log in

An Extension of the Prüfer Code and Assembly of Connected Graphs from Their Blocks

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract.

 We give an extension of the Prüfer code in order to count connected labeled graphs whose blocks are of given type. The Prüfer code records the way of assembling a connected labeled graph from its blocks.

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

Author information

Authors and Affiliations

  1. Department of Mathematics, Faculty of Education, Nagasaki University, Nagasaki 852-8521, Japan. e-mail: kajimoto@net.nagasaki-u.ac.jp, , , , , , JP

    Hiroshi Kajimoto

Authors
  1. Hiroshi Kajimoto
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received: March 15, 2001 Final version received: June 25, 2002

Acknowledgments. The author thanks R. Sawae and T. Sugawara for many helpful discussions and kind assistance. The author wishes to thank also the referees for precious comments and advices.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kajimoto, H. An Extension of the Prüfer Code and Assembly of Connected Graphs from Their Blocks. Graphs and Combinatorics 19, 231–239 (2003). https://doi.org/10.1007/s00373-002-0499-3

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-002-0499-3

Keywords

Search

Navigation