The nonnegative -matrix completion problem.
Choi, Ji Young, Dealba, Luz Maria, Hogben, Leslie, Kivunge, Benard M., Nordstrom, Sandra K., Shedenhelm, Mike (2003)
ELA. The Electronic Journal of Linear Algebra [electronic only]
Similarity:
Displaying similar documents to “The -matrix completion problem.”
The nonnegative -matrix completion problem.
Matrix inversion and digraphs: the one factor case.
Britz, T., Olesky, D.D., van den Driessche, P. (2004)
ELA. The Electronic Journal of Linear Algebra [electronic only]
Similarity:
The -matrix completion problem.
Choi, Ji Young, DeAlba, Luz Maria, Hogben, Leslie, Maxwell, Mandi S., Wangsness, Amy (2002)
ELA. The Electronic Journal of Linear Algebra [electronic only]
Similarity:
Combinatorial properties of Fourier-Motzkin elimination.
Dahl, Geir (2007)
ELA. The Electronic Journal of Linear Algebra [electronic only]
Similarity:
On digraphs with non-derogatory adjacency matrix.
Deng, C.L., Gan, C.S. (1998)
Bulletin of the Malaysian Mathematical Society. Second Series
Similarity:
The maximal spectral radius of a digraph with edges.
Snellman, Jan (2003)
ELA. The Electronic Journal of Linear Algebra [electronic only]
Similarity:
Which directed graphs have a solution?
Mehdi Behzad, Frank Harary (1977)
Mathematica Slovaca
Similarity:
Comparing a Cayley digraph with its reverse.
Abas, M. (2000)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
Sign patterns that require or allow power-positivity.
Catral, Minerva, Hogben, Leslie, Olesky, Dale D., van den Driessche, Pauline (2009)
ELA. The Electronic Journal of Linear Algebra [electronic only]
Similarity:
On Hallian digraphs, permanents and transversals
Miroslaw Arczyński, Mieczysław Borowiecki, Maciej M. Sysło (1979)
Colloquium Mathematicae
Similarity:
A note on removing a point of a strong digraph
Peter Horák (1983)
Mathematica Slovaca
Similarity: