No label defined (Q4133657)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3557817
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 3557817

      Statements

      0 references
      1975
      0 references
      The author is concerned with the enumeration of general graphs on \(t\) trivalent nodes. His technique of destroying the loops if any, and obtaining multigraphs, is nicely explained with the help of an example with \(t= 4\). The tree so obtained is treated as a labelled digraph. This helps the author in axpressing his formula connecting the number of general graphs with the number of multigraphs arising as different steps, as a Kronecker product of two matrices. Actual calculation work will involve partitions of numbers into a certain number of parts and the reviewer's tables cited in the paper come handy for the purpose. The Royal Society ``Tables of Partitions'' which are even more extensive would be of greater use.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references