Trades and graphs
The trade spectrum \(\text{TS}(G)\) 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\). The complement of \(\text{TS}(G)\), \(X(G)\), is called the set of forbidden trade volumes for \(G\). Trade spectra of graphs have applications to intersection problems and defining sets, which in turn have important applications in secret sharing schemes and shared security systems. In this paper the authors investigate the set \(X(G)\) for various graphs \(G\). In particular they give many families of graphs in which \(X(G) = \{1\}\) or \(X(G) = \{1,2\}\). They note that a classification of those graphs \(G\) for which \(2 \in \text{TS}(G)\) is a challenging problem. The tools developed in this paper could be used to determine \(\text{TS}(G)\) for many infinite families of graphs besides the ones explicitly mentioned in the paper.
- Trade spectra of complete partite graphs
- Trade spectrum of \(K_{4} - e\)
- On the volume of -way G-trade
- On the volume of \(\mu\)-way \(S(K_{1,3})\)-trade on \((3, 6)\)-fullerene graphs
- Steiner trade spectra of complete partite graphs
- On the 3-way (v,k,2) Steiner trades
- Large forbidden trade volumes and edge packings of random graphs
This page was built for publication: Trades and graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5936090)
