Title: Factorisation of complete bipartite graphs into two isomorphic subgraphs
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.
Publication Year: 1979
Publication Date: 1979-01-01
Language: en
Type: book-chapter
Indexed In: ['crossref']
Access and Citation
Cited By Count: 4
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot