Fractional biclique covers and partitions of graphs

Electronic Journal of Combinatorics

Volumn 13, Issue 1 R, 2006, Pages 1-14

  Watts, Valerie L ^a  

^a VANCOUVER ISLAND UNIVERSITY   (Canada)

Author keywords

Boolean rank; Fractional biclique covers; Fractional biclique partitions; Weak products

Indexed keywords

EID: 33748335457     PISSN: 10778926     EISSN: 10778926     Source Type: Journal    
DOI: 10.37236/1100     Document Type: Article

References (19)

1. C. Berge, Fractional Graph Theory, ISI Lecture Notes 1 (Macmillan of India, 1978).
2. J. A. Bondy and U. S. R. Murty, Graph Theory with Applications (North Holland, New York, 1976).
3. E.D. Boyer and B.L. Shader, On biclique decompositions of complete t-partite graphs, Linear Algebra Appl. 217 (1995) 31-40.
4. V. Chvátal, Linear Programming (W. H. Freeman and Company, New York, 1983).
5. D. de Caen, D. A. Gregory, T. D. Henson, J. R. Lundgren and J. S. Maybee, Real rank as a bound for non-negative integer rank, J. Comb. Math, and Comb. Comp. 11 (1992) 47-53.
6. D. de Caen, D. A. Gregory and N. J. Pullman, The boolean rank of zero-one matrices I, in: Proc. Third Caribbean Conference on Combinatorics and Computing (Barbados 1981) 169-173.
7. D. de Caen, D. A. Gregory and N. J. Pullman, The boolean rank of zero-one matrices II, in: Proc. Fifth Caribbean Conference on Cominatorics and Computing (Barbados 1988) 120-126.
8. F. C. C. Doherty, J. R. Lundgren and D.J. Siewert, Biclique covers and partitions of bipartite graphs and digraphs and related matrix ranks of {0, 1}-matrices, Congressus Numerantium 136 (1999) 73-96.
9. R. L. Graham and H. O. Pollak, On the addressing problem for loop switching, Bell System Tech. J. 50 (1971) 2495-2519.
10. D. A. Gregory and N. J. Pullman, Semiring rank: boolean rank and nonnegative rank factorizations, J. Combin. Inform. System Sci. 8 (1983) 223-233.
11. D. A. Gregory, B. L. Shader and V. L. Watts, Biclique decompositions and Hermitian rank, Linear Algebra Appl. 292 (1999) 267-280.
12. F. Harary, D. Hsu and Z. Miller, The biparticity of a graph, J. Graph Theory 1 (1977) no. 2 131-133.
13. Ki Hang Kim, Boolean Matrix Theory and Applications (Marcel Dekker, Inc., New York, 1982).
14. T. Kratzke, B. Reznick and D. West, Eigensharp graphs: decomposition into complete bipartite subgraphs, Trans. Amer. Math. Soc. 308 (1988) 637-653.
15. S. D. Monson, N. J. Pullman and R. Rees, A survey of clique and biclique coverings and factorizations of (0, 1)-matrices, Bulletin of the I.C.A. 14 (1995) 17-86.
16. J. Orlin, Contentment in graph theory: covering graphs with cliques, Indag. Math. 39 (1977) 406-424.
17. E. R. Scheinerman and D. H. Ullman, Fractional Graph Theory: A Rational Approach to the Theory of Graphs (John Wiley and Sons, Inc., New York, 1997).
18. V. L. Watts, Boolean rank of Kronecker products, Linear Algebra Appl. 336 (2001) 261-264.
19. V. L. Watts, Biclique covers and partitions of graphs, Ph.d Thesis, Department of Mathematics and Statistics, Queen's Univesity, 2001.