Hostname: page-component-7bb8b95d7b-5mhkq Total loading time: 0 Render date: 2024-09-16T13:49:46.535Z Has data issue: false hasContentIssue false
  • English
  • Français

The Number of Circular Patterns Compatible with a Pseudo-Symmetric Connected Graph

Published online by Cambridge University Press:  20 November 2018

L. E. Baum  and
J. A. Eagon
L. E. Baum
Affiliation:
Institute for Defense Analyses, Princeton, New Jersey
J. A. Eagon
Affiliation:
Institute for Defense Analyses, Princeton, New Jersey
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.

In this paper we prove:

Theorem. Let be an ordered pseudo-symmetric connected graph with l lines and v vertices. Let there be aij lines directed from vertex i to vertex j, i, j = 1, 2, … , v. Let gcd(aij) = d, and define

Type
Research Article
Information
Canadian Journal of Mathematics , Volume 18 , 1966 , pp. 237 - 239
Copyright
Copyright © Canadian Mathematical Society 1966

References

1. Berge, C., The theory of graphs and its applications (New York, 1962).Google Scholar
2. LeVeque, W., Topics in number theory (Reading, Mass., 1956).Google Scholar
3. Good, I. J., Normal recurring decimals, J. London Math. Soc, 21 (1946), 167–169.Google Scholar