Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-16T08:08:44.518Z Has data issue: false hasContentIssue false

Self-complementary graph decompositions

Published online by Cambridge University Press:  09 April 2009

C. A. Rodger
Affiliation:
120 Mathematics AnnexAuburn UniversityAuburn, AL 36849-5307, USA
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

A complementary decomposition of λKn into a graph G is an edge-disjoint decomposition of λKn into copies of G such that if each copy H of G is replaced by its complement in V(H) then the result is an edge-disjoint decomposition of λKn into copies of GC it is a self- complementary decomposition if G = Gc. The spectrum for the last self-complementary graph on at most 7 vertices is found.

Information

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 1992