Skip to main content

On the enumeration of certain graceful graphs

Contributed Papers

Part of the Lecture Notes in Mathematics book series (LNM,volume 686)

Abstract

A graceful graph on n vertices is said to be simple if each of its connected components has at most one cycle and the component containing the edge with end points labelled 1 and n has no cycle. Let sn and tn denote the numbers of simple graceful graphs and graceful trees on n vertices respectively. Then tn≦sn≦p(An-2) where p(An-2) is the permanent (plus determinant) of the (n-2)×(n-2) matrix An-2=(aij) defined by:

More specifically, let ci denote the number of simple graceful graphs on n vertices with i cycles (i=0,1,2,...,k, where k=[(n-2)/3]). Then we have

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   34.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   46.00
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Reference

  1. I. Cahit, "Are all complete binary trees graceful?" Amer. Math. Monthly 83(1976), 35–37.

    CrossRef  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1978 Springer-Verlag

About this paper

Cite this paper

Chen, C.C. (1978). On the enumeration of certain graceful graphs. In: Holton, D.A., Seberry, J. (eds) Combinatorial Mathematics. Lecture Notes in Mathematics, vol 686. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0062523

Download citation

  • DOI: https://doi.org/10.1007/BFb0062523

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-08953-7

  • Online ISBN: 978-3-540-35702-5

  • eBook Packages: Springer Book Archive