Fixing subgraphs of Km,n
We characterise the fixing subgraphs of complete bipartite graphs Km,n and study various aspects of those which are minimal. These minimal fixing subgraphs are necessarily forests. In particular, we show that any given tree with parts of unequal size is a component of a minimal fixing subgraph of some Km,n.
Unable to display preview. Download preview PDF.