D-optimal block designs with at most six varieties
type: Item
instance of: scholarly article
title: D-optimal block designs with at most six varieties
zbMATH Open document ID: 0481.62058
DOI: 10.1016/0378-3758(82)90088-X
published in: Journal of Statistical Planning and Inference
publication date: 1982-01-01T00:00:00Z
Mathematics Subject Classification ID: 62K05
Mathematics Subject Classification ID: 62K10
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 3755701
zbMATH Keywords: multigraph
zbMATH Keywords: spanning tree
zbMATH Keywords: balanced block design
zbMATH Keywords: regular graph design
zbMATH Keywords: complexity
author: Norbert Gaffke
MaRDI profile type: Publication
cites work: Optimality of certain asymmetrical experimental designs
cites work: Q3666077
cites work: Maximizing the total number of spanning trees in a graph: two related problems in graph theory and optimum design theory
cites work: Connected graphs with a minimal number of spanning trees
cites work: Some classes of optimality criteria and optimal designs for complete two- way layouts
cites work: Parallel concepts in graph theory
cites work: Q4124844
cites work: A certain polynomial of a graph and graphs with an extremal number of trees
cites work: Q4072671
cites work: Q5836512
cites work: Q4087208
cites work: Maximizing the number of spanning trees in a graph with n nodes and m edges
full work available at URL: 0378-3758(82)90088-x
OpenAlex ID: W1986370089
description: scientific article; zbMATH DE number 3755701