#### Filter Results:

- Full text PDF available (11)

#### Publication Year

1994

2017

- This year (0)
- Last 5 years (1)
- Last 10 years (5)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Luz M. DeAlba, Irvin Roy Hentzel, +5 authors Kevin N. Vander Meulen
- 2006

A sign pattern Z (a matrix whose entries are elements of {+,âˆ’, 0}) is spectrally arbitrary if for any selfconjugate spectrum there is a real matrix with sign pattern Z having the given spectrum.â€¦ (More)

- Luz M. DeAlba, T L Hardy, Irvin Roy Hentzel, Leslie Hogben, AMY WANGSNESS
- 2005

The set of real matrices described by a sign pattern (a square matrix whose entries are elements of {+,âˆ’, 0}) has been studied extensively. A simple graph has been associated with the set ofâ€¦ (More)

- Abraham Berman, Minerva Catral, +7 authors Pauline van den Driessche
- 2010

Several necessary or sufficient conditions for a sign pattern to allow eventual positivity are established. It is also shown that certain families of sign patterns do not allow eventual positivity.â€¦ (More)

- Luz M. DeAlba, Colin Garnett, Amy Wangsness Wehe
- 2009

The minimum (symmetric) rank of a simple graph G over a field F is the smallest possible rank among all symmetric matrices over F whose ijth entry (for i 6= j) is nonzero whenever {i, j} is an edgeâ€¦ (More)

A list of positions in an n Ã— n real matrix (a pattern) is said to have P-completion if every partial P-matrix that specifies exactly these positions can be completed to a P-matrix. We extend work ofâ€¦ (More)

A real n Ã— n matrix is a Q-matrix if for every k = 1, 2, . . . , n the sum of all k Ã— k principal minors is positive. A digraph D is said to have Q-completion if every partial Q-matrix specifying Dâ€¦ (More)

- Milan Randic, Luz M. DeAlba
- Journal of Chemical Information and Computerâ€¦
- 1997

We consider rigorous definitions for dense graphs and sparse matrices, thus quantifying these concepts that have been hitherto used in a qualitative manner. We assign to every graph the compactnessâ€¦ (More)

- Milan Randi, Luz M. DeAlba, Frank E. Harrisb
- 2003

The detour matrix (DD) of a graph has for its (i,j) entry the length of the longest path between vertices i and j. The sum of all entries above the main diagonal gives the detour index dd. Distinctâ€¦ (More)

- Luz M. DeAlba, Jason Grout, Leslie Hogben, RANA MIKKELSON, K C Rasmussen
- 2008

The minimum rank of a simple graph G over a field F is the smallest possible rank among all symmetric matrices over F whose (i, j)th entry (for i = j) is nonzero whenever {i, j} is an edge in G andâ€¦ (More)

- Luz M. DeAlba, T L Hardy, Leslie Hogben, AMY WANGSNESS
- 2003

In this paper we show that a partial sign symmetric P -matrix, whose graph of specified entries is an n-cycle with n â‰¥ 6, can be completed to a sign symmetric P -matrix. The analogous completionâ€¦ (More)