-
1
-
-
0029543087
-
A rank-one reduction formula and its applications to matrix factorizations
-
M.T. Chu, R.E. Funderlic, G.H. Golub, A rank-one reduction formula and its applications to matrix factorizations, SIAM Rev. 37 (4) (1995) 512-530.
-
(1995)
SIAM Rev.
, vol.37
, Issue.4
, pp. 512-530
-
-
Chu, M.T.1
Funderlic, R.E.2
Golub, G.H.3
-
2
-
-
0004092833
-
Spectra of Graphs
-
Academic Press, New York
-
D. Cvetković, M. Doob, H. Sachs, Spectra of Graphs, Academic Press, New York, 1979.
-
(1979)
-
-
Cvetković, D.1
Doob, M.2
Sachs, H.3
-
3
-
-
0002923688
-
A table of connected graphs on six vertices
-
D. Cvetković, M. Petrić, A table of connected graphs on six vertices, Discrete Math. 50 (1984) 37-49.
-
(1984)
Discrete Math.
, vol.50
, pp. 37-49
-
-
Cvetković, D.1
Petrić, M.2
-
4
-
-
0038363005
-
Minimum biclique partitions of the complete graph and related designs
-
R. Rees (Ed.), Dekker, New York
-
D. de Caen, D.A. Gregory, D. Pritikin, Minimum biclique partitions of the complete graph and related designs, in: R. Rees (Ed.), Graphs, Matrices and Designs, Dekker, New York, 1993.
-
(1993)
Graphs, Matrices and Designs
-
-
de Caen, D.1
Gregory, D.A.2
Pritikin, D.3
-
5
-
-
0003829617
-
Algebraic Graph Theory
-
Springer, New York
-
C. Godsil, G. Royle, Algebraic Graph Theory, Springer, New York, 2001.
-
(2001)
-
-
Godsil, C.1
Royle, G.2
-
6
-
-
0015142942
-
On the addressing problem for loop switching
-
R.L. Graham, H.O. Pollak, On the addressing problem for loop switching, Bell System Tech. J. 50 (8) (1971) 1133-1145.
-
(1971)
Bell System Tech. J.
, vol.50
, Issue.8
, pp. 1133-1145
-
-
Graham, R.L.1
Pollak, H.O.2
-
8
-
-
0038362976
-
Decompositions of complete multigraphs related to Hadamard matrices
-
D.A. Gregory, K.N. Vander Meulen, Decompositions of complete multigraphs related to Hadamard matrices, J. Combin. Theory Ser. A 82 (1998) 158-167.
-
(1998)
J. Combin. Theory Ser. A
, vol.82
, pp. 158-167
-
-
Gregory, D.A.1
Vander Meulen, K.N.2
-
9
-
-
0007058327
-
Eigenvalues and partitionings of the edges of a graph
-
A.J. Hoffman, Eigenvalues and partitionings of the edges of a graph, Linear Algebra Appl. 5 (1972) 137-146.
-
(1972)
Linear Algebra Appl.
, vol.5
, pp. 137-146
-
-
Hoffman, A.J.1
-
10
-
-
0004151494
-
Matrix Analysis
-
Cambridge University Press, New York
-
R. Horn, C.R. Johnson, Matrix Analysis, Cambridge University Press, New York, 1985.
-
(1985)
-
-
Horn, R.1
Johnson, C.R.2
-
11
-
-
0037686957
-
Eigensharp graphs: Decomposition into complete bipartite subgraphs
-
T. Kratzke, B. Reznick, D. West, Eigensharp graphs: decomposition into complete bipartite subgraphs, Trans. Amer. Math. Soc. 308 (2) (1988) 637-653.
-
(1988)
Trans. Amer. Math. Soc.
, vol.308
, Issue.2
, pp. 637-653
-
-
Kratzke, T.1
Reznick, B.2
West, D.3
-
12
-
-
0007202012
-
A survey of clique and biclique coverings and factorizations of (0,1)-matrices
-
S.D. Monson, S.J. Pullman, R. Rees, A survey of clique and biclique coverings and factorizations of (0,1)-matrices, Bull. ICA 14 (1995) 17-86.
-
(1995)
Bull. ICA
, vol.14
, pp. 17-86
-
-
Monson, S.D.1
Pullman, S.J.2
Rees, R.3
-
14
-
-
49349132396
-
Contentment in graph theory
-
J. Orlin, Contentment in graph theory, Indag. Math. 39 (1977) 406-424.
-
(1977)
Indag. Math.
, vol.39
, pp. 406-424
-
-
Orlin, J.1
-
15
-
-
0038024948
-
Covers and decompositions of graphs by complete multipartite subgraphs
-
Ph.D. Thesis, Queen's University, Kingston
-
K.N. Vander Meulen, Covers and decompositions of graphs by complete multipartite subgraphs, Ph.D. Thesis, Queen's University, Kingston, 1995.
-
(1995)
-
-
Vander Meulen, K.N.1
-
16
-
-
0034401711
-
A tree whose complement is not eigensharp
-
V. Watts, A tree whose complement is not eigensharp, Linear Algebra Appl. 306 (2000) 183-188.
-
(2000)
Linear Algebra Appl.
, vol.306
, pp. 183-188
-
-
Watts, V.1
|
