Abstract
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.
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Reference
J. Sheehan, "Fixing subgraphs", J. Comb. Th., (B), 12 (1972), 226–244.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1978 Springer-Verlag
About this paper
Cite this paper
Chidzey, K. (1978). Fixing subgraphs of Km,n . In: Holton, D.A., Seberry, J. (eds) Combinatorial Mathematics. Lecture Notes in Mathematics, vol 686. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0062524
Download citation
DOI: https://doi.org/10.1007/BFb0062524
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08953-7
Online ISBN: 978-3-540-35702-5
eBook Packages: Springer Book Archive
