The Number of Circular Patterns Compatible with a Pseudo-Symmetric Connected Graph
Canadian journal of mathematics, Tome 18 (1966) no. 1, pp. 237-239
Voir la notice de l'article provenant de la source Cambridge University Press
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
Baum, L. E.; Eagon, J. A. The Number of Circular Patterns Compatible with a Pseudo-Symmetric Connected Graph. Canadian journal of mathematics, Tome 18 (1966) no. 1, pp. 237-239. doi: 10.4153/CJM-1966-026-4
@article{10_4153_CJM_1966_026_4,
author = {Baum, L. E. and Eagon, J. A.},
title = {The {Number} of {Circular} {Patterns} {Compatible} with a {Pseudo-Symmetric} {Connected} {Graph}},
journal = {Canadian journal of mathematics},
pages = {237--239},
year = {1966},
volume = {18},
number = {1},
doi = {10.4153/CJM-1966-026-4},
url = {http://geodesic.mathdoc.fr/articles/10.4153/CJM-1966-026-4/}
}
TY - JOUR AU - Baum, L. E. AU - Eagon, J. A. TI - The Number of Circular Patterns Compatible with a Pseudo-Symmetric Connected Graph JO - Canadian journal of mathematics PY - 1966 SP - 237 EP - 239 VL - 18 IS - 1 UR - http://geodesic.mathdoc.fr/articles/10.4153/CJM-1966-026-4/ DO - 10.4153/CJM-1966-026-4 ID - 10_4153_CJM_1966_026_4 ER -
%0 Journal Article %A Baum, L. E. %A Eagon, J. A. %T The Number of Circular Patterns Compatible with a Pseudo-Symmetric Connected Graph %J Canadian journal of mathematics %D 1966 %P 237-239 %V 18 %N 1 %U http://geodesic.mathdoc.fr/articles/10.4153/CJM-1966-026-4/ %R 10.4153/CJM-1966-026-4 %F 10_4153_CJM_1966_026_4
[1] 1. Berge, C., The theory of graphs and its applications (New York, 1962). Google Scholar
[2] 2. LeVeque, W., Topics in number theory (Reading, Mass., 1956). Google Scholar
[3] 3. Good, I. J., Normal recurring decimals, J. London Math. Soc, 21 (1946), 167–169. Google Scholar
Cité par Sources :