|Journal of Integer Sequences, Vol. 3 (2000), Article 00.2.6|
Abstract: A bijection between split graphs and minimal covers of a set by subsets is presented. As the enumeration problem for such minimal covers has been solved, this implies that split graphs can also be enumerated.
(Concerned with sequence A048194.)
Received May 3, 2000; published in Journal of Integer Sequences June 7, 2000.