Graphs, Matrices, and Designs

Front Cover
CRC Press, Sep 25, 1992 - Mathematics - 344 pages
0 Reviews
Reviews aren't verified, but Google checks for and removes fake content when it's identified
Examines partitions and covers of graphs and digraphs, latin squares, pairwise balanced designs with prescribed block sizes, ranks and permanents, extremal graph theory, Hadamard matrices and graph factorizations. This book is designed to be of interest to applied mathematicians, computer scientists and communications researchers.
 

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

Linear Operators Preserving Partition Numbers of Graphs
19
Completion of the Spectrum of Orthogonal Diagonal Latin Squares
43
Extremal Problems for the BondyChvátal Closure of a Graph
73
Ivan Friš Department of Mathematics Statistics and Computing Science University
92
Minimum Biclique Partitions of the Complete Multigraph
93
Multiplicativity of Generalized Permanents over Semirings
121
Pairwise Balanced Designs with Block Sizes 5t + 1
147
Pairwise Balanced Designs with Holes
171
The Sum Number of Complete Bipartite Graphs
205
Nora Hartsfield Department of Mathematics Western Washington University
213
Maximal Partial Latin Squares
225
Katherine Heinrich Department of Mathematics Simon Fraser University
237
Construction of New Hadamard Matrices with Maximal Excess
255
Maximum Order Digraphs for Diameter 2 or Degree 2
269
The Cycle Space of an Embedded Graph III
295
Copyright

Other editions - View all

Common terms and phrases

Bibliographic information