On the Redfield-Read combinatory algorithm

  • I. É. Mullat
Article

Abstract

This note is devoted to a generalization of the Redfield-Read superposition theorem. Several ways of using this theorem in the generalized form are cited, after which, by way of illustration, a problem of graph enumeration is solved.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literature cited

  1. 1.
    G. Pólya, “Kombinatorische Anzahlbestimmüngen für Gruppen, Graphen und chemische Verbindungen, Acta math.,68, 145–254 (1937).Google Scholar
  2. 2.
    R. C. Read, “The enumeration of locally restricted graphs, I, II,” J. London Math. Soc.,34, 417–436 (1959);35, 344–451 (1960).Google Scholar
  3. 3.
    J. H. Redfield, “The theory of group-reduced distributions,” Amer. J. Math.,49, 433–455 (1927).Google Scholar
  4. 4.
    Applied Combinatorial Mathematics [in Russian], Collected Papers, É. Bekkenbakh (editor), Moscow (1968).Google Scholar
  5. 5.
    C. Berge, The Theory of Graphs and Its Applications [Russian translation], Moscow (1962).Google Scholar
  6. 6.
    M. Hall, Group Theory [Russian translation], Moscow (1962).Google Scholar
  7. 7.
    J. Riordan, An Introduction to Combinatorial Analysis, John Wiley and Sons, Inc., New York (1958).Google Scholar

Copyright information

© Consultants Bureau 1970

Authors and Affiliations

  • I. É. Mullat
    • 1
  1. 1.Scientific Research Institute of Applied Mathematics and CyberneticsN. I. Lobachevskii Gor'kii State UniversityUSSR

Personalised recommendations