|
| << previous | next >> |
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
Details for article 4 of 12 found articles
| Title: |
Graph complexity and the laplacian matrix in blocked experiments |
| Author: |
Constantine, Gregory M. |
| Appeared in: |
Linear & multilinear algebra |
| Paging: | Volume 28 (1990) nr. 1-2 pages 49-56 |
| Year: |
1990-10 |
| Contents: |
connections between the efficiency of statistical designs, the Laplacian matrix studied in algebra, and graphs of maximal complexity are being described. Up to a positive scalar multiple the Laplacian (or Kirchhoff) matrix concides with the information matrix that arises out of a statistical additive model with treatment and block effects. By way of the matrix-tree theorem design efficiency is shown to be closely related to graph complexity. Several open questions regarding graphs of maximal complexity are being brought to attention. |
| Publisher: |
Taylor & Francis |
| Source file: |
Elektronische Wetenschappelijke Tijdschriften |
Details for article 4 of 12 found articles
| << previous | next >> |