Abstract.
The trade spectrum of a simple graph G is defined to be the set of all t for which it is possible to assemble together t copies of G into a simple graph H, and then disassemble H into t entirely different copies of G. Trade spectra of graphs have applications to intersection problems, and defining sets, of G-designs. In this investigation, we give several constructions, both for specific families of graphs, and for graphs in general.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: October 3, 1997 Final version received: May 7, 1999
Rights and permissions
About this article
Cite this article
Billington, E., Hoffman, D. Trades and Graphs. Graphs Comb 17, 39–54 (2001). https://doi.org/10.1007/PL00007238
Issue Date:
DOI: https://doi.org/10.1007/PL00007238