Eigensharp Graphs: Decomposition into Complete Bipartite Subgraphs

Let r(G) be the minimum number of complete bipartite subgraphs needed to partition the edges of G, and let r'G) be the larger of the number of positive and number of negative eigenvalues of G. It is known that T{G) > r(G); graphs with t(G) = r(G) are called eigensharp. Eigensharp graphs include graphs, trees, cycles Cn with n = 4 or n ^ 4k, prisms Cn\2K2 with n ^ 3fc, "twisted prisms" (also called "Mobius ladders") Mn with n = 3 or n t^ 3fc, and some Cartesian products of cycles. Under some conditions, the weak (Kronecker) product of eigensharp graphs is eigensharp. For example, the class of eigensharp graphs with the same number of positive and negative eigenvalues is closed under weak products. If each graph in a finite weak product is eigensharp, has no zero eigenvalues, and has a decomposition into r(G) stars, then the product is eigensharp. The hypotheses in this last result can be weakened. Finally, not all weak products of eigensharp graphs are eigensharp.