Contents

-

On the Spectra of Bipartite Directed Subgraphs of Kn

R.C. Bunge1, S. 1. El-Zainat2, H. J. Fry3, K.S. Krauss4, D.P. Roberts5, C. A. Sullivan6, A. A. Unsicker, N. BE. Witt
1Illinois State University, Normal, IL 61790
2 Alma College, Alma, MI 48801
3Tllinois Wesleyan University, Bloomington, IL 61701
4Bowling Green State University, Bowling Green, OH 43403
5Brigham Young University, Provo, UT 84602
6Simeon Career Academy, Chicago, IL, 60620

Abstract

The complete directed graph of order n, denoted Kn, is the directed graph on n vertices that contains the arcs (u,v) and (v,u) for every pair of distinct vertices u and v. For a given directed graph D, the set of all n for which Kn admits a D-decomposition is called the spectrum of D. In this paper, we find the spectrum for each bipartite subgraph of K4 with 5 or fewer arcs.