Abstract
A construction method is given which generates all factorisations of the complete bipartite graph K m,n into two isomorphic line disjoint subgraphs. Such subgraphs are called self-complementary bipartite subgraphs, by analogy with ordinary self-complementary graphs. It is shown that the factorisation giving rise to a self-complementary bipartite graph is unique up to isomorphism. Based on this fact a method is developed for counting unlabelled self-complementary bipartite graphs.
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.
References
F. Harary, On the number of bicoloured graphs, Pacific J. Math., 8 (1958), 743–755.
F. Harary, Graph Theory (Addison-Wesley, Mass., 1969).
F. Harary and E.M. Palmer, Graphical Enumeration (Academic Press, New York, 1973).
F. Harary and G. Prins, Enumeration of bicolourable graphs, Canad. J. Math. 15 (1963), 237–248.
F. Harary, R.W. Robinson and N.C. Wormald, Isomorphic factorisations I: complete graphs, Trans. Amer. Math. Soc., 242 (1978), 243–260.
F. Harary, R.W. Robinson and N.C. Wormald, Isomorphic factorisations III: complete multipartite graphs, Proc. Int. Conf. on Combinatorial Theory (Springer-Verlag, Berlin, to appear).
R.C. Read, On the number of self-complementary graphs and digraphs, J. London Math. Soc., 38 (1963), 99–104.
G. Ringel, Selbstkomplementäre graphen, Arch. Math., 14 (1963), 354–358.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1979 Springer-Verlag
About this paper
Cite this paper
Quinn, S.J. (1979). Factorisation of complete bipartite graphs into two isomorphic subgraphs. In: Horadam, A.F., Wallis, W.D. (eds) Combinatorial Mathematics VI. Lecture Notes in Mathematics, vol 748. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0102688
Download citation
DOI: https://doi.org/10.1007/BFb0102688
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-09555-2
Online ISBN: 978-3-540-34857-3
eBook Packages: Springer Book Archive
