Hostname: page-component-586b7cd67f-l7hp2 Total loading time: 0 Render date: 2024-11-25T19:13:16.589Z Has data issue: false hasContentIssue false
  • English
  • Français

On the Number of Dissimilar Graphs Between a Given Graph-Subgraph Pair

Published online by Cambridge University Press:  20 November 2018

Frank Harary
Frank Harary*
Affiliation:
University of Michigan
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

The purpose of this paper is to integrate the theorems on enumerating subgraphs and supergraphs in (2) and (3) respectively by generalizing to a result which includes both of these as special cases. In this process we again utilize the powerful enumeration method of Pólya (4).

Type
Research Article
Information
Canadian Journal of Mathematics , Volume 10 , 1958 , pp. 513 - 516
Copyright
Copyright © Canadian Mathematical Society 1958

References

1. Harary, F., The number of linear, directed, rooted and connected graphs, Trans. Amer. Math. Soc, 78 (1955), 445-463.Google Scholar
2. Harary, F., On the number of dissimilar line-sub graphs of a given graph, Pacific J. Math., 6 (1956), 57-64.Google Scholar
3. Harary, F., The number of dissimilar supergraphs of a linear graph, Pacific J. Math., 7 (1957), 903-911.Google Scholar
4. Polya, G., Kombinatorische Anzahlbestimmungen fur Gruppen, Graphen und chemische Verbindungen, Acta Math, 68 (1937), 145-254.Google Scholar