The number of minimally connected block designs
type: Item
instance of: scholarly article
title: The number of minimally connected block designs
zbMATH Open document ID: 0603.62083
DOI: 10.1016/0167-9473(86)90007-1
author: Yadolah Dodge
author: David S. Birkes
published in: Computational Statistics and Data Analysis
publication date: 1986-01-01T00:00:00Z
review text: The formula \(a^{b-1} b^{a-1}\) is derived for the number of connected \(a\times b\) block designs having the least possible number, \(a+b-1\), of observations needed for connectedness. It is shown that this formula also arises as the number of labeled bicolored trees with a vertices of one color and b vertices of the other.
Mathematics Subject Classification ID: 62K10
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 3974112
zbMATH Keywords: minimally connected block designs
zbMATH Keywords: labeled bicolored trees
MaRDI profile type: Publication
full work available at URL: 0167-9473(86)90007-1
OpenAlex ID: W2027389896
cites work: The Enumeration of Point Labelled Chromatic Graphs and Trees
cites work: Spanning sets for estimable contrasts in classification models
cites work: Q3030057
cites work: Q5627526
cites work: Q5589310
cites work: Q5734985
cites work: A NOTE ON THE ENUMERATION AND LISTING OF ALL POSSIBLE TREES IN A CONNECTED LINEAR GRAPH
description: scientific article; zbMATH DE number 3974112