Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-16T17:25:23.258Z Has data issue: false hasContentIssue false

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

Published online by Cambridge University Press:  20 November 2018

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

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1966