Skip to main content
×
×
Home

Enumeration Of Labelled Graphs

  • E. N. Gilbert (a1)
Extract

1. Introduction. The number of connected linear graphs having V vertices labelled 1, … , V and λ (unlabelled) lines is found below. Similar formulas are found for graphs in which slings, lines “in parallel,” or both are allowed and for directed graphs with or without slings or parallel lines. Some of these graphs are also counted when the lines are labelled and the vertices are unlabelled.

    • Send article to Kindle

      To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

      Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

      Find out more about the Kindle Personal Document Service.

      Enumeration Of Labelled Graphs
      Available formats
      ×
      Send article to Dropbox

      To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

      Enumeration Of Labelled Graphs
      Available formats
      ×
      Send article to Google Drive

      To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

      Enumeration Of Labelled Graphs
      Available formats
      ×
Copyright
References
Hide All
1. Bell, E. T., Exponential polynomials, Ann. Math., 35 (1934), 258277.
2. Bell, E. T., Postulational bases for the umbral calculus, Amer. J. Math., 62 (1940), 717724.
3. Davis, R. L., The number of structures of finite relations, Proc. Amer. Math. Soc, 4 (1953), 486495.
4. Harary, F., The number of linear, directed, rooted and connected graphs, Trans. Amer. Math. Soc, 78 (1955), 445463.
5. Jordan, C., Calculus of Finite Differences (New York, 1950).
6. Kaplansky, I. and Riordan, J., Multiple matching and runs by the symbolic method, Ann. Math. Stat. (3), 16 (1945), 272277.
7. König, D., Theorie der endlichen und unendlichen Graphen (New York, 1950).
8. Netto, E., Lehrbuch der Combinatorik (Leipzig, 1901).
9. Riddell, R. J., Jr. and Uhlenbeck, G. E., On the theory of the virial development of the equation of state of monoatomic gases, J. Chem. Phys., 21 (1953), 20562064.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Canadian Journal of Mathematics
  • ISSN: 0008-414X
  • EISSN: 1496-4279
  • URL: /core/journals/canadian-journal-of-mathematics
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×
MathJax

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed