Hostname: page-component-586b7cd67f-t7fkt Total loading time: 0 Render date: 2024-11-26T08:44:52.174Z Has data issue: false hasContentIssue false
  • English
  • Français

The number of trees with nodes of alternate parity

Published online by Cambridge University Press:  24 October 2008

H. I. Scoins
H. I. Scoins
Affiliation:
University Computing LaboratoryNewcastle upon Tyne
Get access Rights & Permissions [Opens in a new window]

Extract

Interest in the theory of linear graphs has grown recently in several fields which at first sight seem rather far apart. Recent publications include an excellent review by Bryant(1) of electrical network theory, statistical mechanical work by Sykes(2) and in the field of linear programming a paper by Glicksman, Johnson and Eselson (3). It is in this latter field that the subject of this paper arose, but we shall confine attention here to the graph theoretical aspect alone.

Type
Research Article
Information
Mathematical Proceedings of the Cambridge Philosophical Society , Volume 58 , Issue 1 , January 1962 , pp. 12 - 16
Copyright
Copyright © Cambridge Philosophical Society 1962

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

(1)Bryant, P. R.The algebra and topology of electrical networks (Proc. Inst. Elect. Engrs., Monograph 414E, 1960).Google Scholar
(2)Sykes, M. F.Some counting theorems in the theory of the Ising model and the excluded volume theory. J. Mathematical Phys. 2 (1961), 52–62.CrossRefGoogle Scholar
(3)Glicksman, S., Johnson, L. and Eselson, L.Coding the transportation problem. Naval Res. Legist. Quart. 7 (1960), 169–83.CrossRefGoogle Scholar
(4)Riordan, J.An introduction to combinatorial analysis. (New York, 1958).Google Scholar
(5)Neville, E. H.The codifying of tree-structures. Proc. Cambridge Philos. Soc. 49 (1953), 381–5.CrossRefGoogle Scholar
(6)Whittaker, E. T. and Watson, G. N.A course of modern analysis, 4th ed. (Cambridge, 1927).Google Scholar
(7)Harary, F. and Prins, G.The number of homeomorphically irreducible trees and other species. Acta Math. 101 (1959), 141–62.CrossRefGoogle Scholar
(8)Riordan, J.The numbers of labelled, coloured and chromatic trees. Acta Math. 97 (1957), 211–25.CrossRefGoogle Scholar