scientific article; zbMATH DE number 3557817
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.
- Relation between graph of a lattice with respect to its ideals and corresponding adjacency matrix
- Lattices associated with distance-regular graphs
- Hankel Matrices: From Words to Graphs (Extended Abstract)
- Lattices associated with Hamming graphs.
- scientific article; zbMATH DE number 3943853 (Why is no real title available?)
- scientific article; zbMATH DE number 62137 (Why is no real title available?)
- scientific article; zbMATH DE number 94973 (Why is no real title available?)
- scientific article; zbMATH DE number 558563 (Why is no real title available?)
- scientific article; zbMATH DE number 1498419 (Why is no real title available?)
- On matrix and lattice ideals of digraphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4133657)