The following pages link to Shaun M. Fallat (Q184480):
Displaying 50 items.
- The enhanced principal rank characteristic sequence (Q269271) (← links)
- The enhanced principal rank characteristic sequence for skew-symmetric matrices (Q269285) (← links)
- Note on Nordhaus-Gaddum problems for Colin de Verdière type parameters (Q396902) (← links)
- The principal rank characteristic sequence over various fields (Q401187) (← links)
- (Q417454) (redirect page) (← links)
- Bipartiteness and the least eigenvalue of signless Laplacian of graphs (Q417455) (← links)
- On the graph complement conjecture for minimum rank (Q417528) (← links)
- Skew-adjacency matrices of graphs (Q417551) (← links)
- The minimum rank of universal adjacency matrices (Q448355) (← links)
- Total positivity of sums, Hadamard products and Hadamard powers: results and counterexamples (Q513234) (← links)
- Graph theoretic aspects of maximizing the spectral radius of nonnegative matrices (Q677122) (← links)
- A remark on oscillatory matrices (Q703626) (← links)
- On the minimum rank of the join of graphs and decomposable graphs (Q869896) (← links)
- Hadamard powers and totally positive matrices (Q880047) (← links)
- A class of oscillatory matrices with exponent \(n - 1\) (Q886148) (← links)
- On acyclic and unicyclic graphs whose minimum rank equals the diameter (Q947619) (← links)
- On the normalized Laplacian energy and general Randić index \(R_{-1}\) of graphs (Q972793) (← links)
- Zero forcing parameters and minimum rank problems (Q975607) (← links)
- The minimum rank of symmetric matrices described by a graph: a survey (Q996311) (← links)
- Sub-direct sums and positivity classes of matrices (Q1300873) (← links)
- Olga, matrix theory and the Taussky unification problem (Q1307515) (← links)
- Eigenvalue location for nonnegative and Z-matrices (Q1307534) (← links)
- Multiplicative principal-minor inequalities for totally nonnegative matrices (Q1408264) (← links)
- On graphs with algebraic connectivity equal to minimum edge density (Q1414127) (← links)
- \(P\)-matrix completions under weak symmetry assumptions (Q1573659) (← links)
- Minimizing algebraic connectivity over connected graphs with fixed girth (Q1613533) (← links)
- Infection in hypergraphs (Q1701092) (← links)
- Further applications of the Cauchon algorithm to rank determination and bidiagonal factorization (Q1743086) (← links)
- The quasi principal rank characteristic sequence (Q1748070) (← links)
- Multiplicative preservers on semigroups of matrices (Q1855374) (← links)
- Generalized oscillatory matrices (Q1864962) (← links)
- Computation of minimal rank and path cover number for certain graphs (Q1887507) (← links)
- Total positivity in Markov structures (Q2012931) (← links)
- On the relationships between zero forcing numbers and certain graph coverings (Q2017194) (← links)
- On the minimum number of distinct eigenvalues of a threshold graph (Q2133671) (← links)
- The bifurcation lemma for strong properties in the inverse eigenvalue problem of a graph (Q2144236) (← links)
- Complex Hadamard diagonalisable graphs (Q2197273) (← links)
- On the almost-principal minors of a symmetric matrix (Q2199354) (← links)
- Corrigendum to: ``Achievable multiplicity partitions in the inverse eigenvalue problem of a graph'' (Q2217786) (← links)
- Properties of a \(q\)-analogue of zero forcing (Q2227980) (← links)
- Correction to: ``Properties of a \(q\)-analogue of zero forcing'' (Q2227981) (← links)
- Weakly Hadamard diagonalizable graphs (Q2228102) (← links)
- Corrigendum to: ``Total positivity of sums, Hadamard products and Hadamard powers: results and counterexamples'' (Q2229467) (← links)
- The Erdős-Ko-Rado theorem for 2-intersecting families of perfect matchings (Q2232305) (← links)
- Achievable multiplicity partitions in the inverse eigenvalue problem of a graph (Q2302881) (← links)
- The maximum multiplicity of the largest \(k\)-th eigenvalue in a matrix whose graph is acyclic or unicyclic (Q2317668) (← links)
- Generalizations of the strong Arnold property and the minimum number of distinct eigenvalues of a graph (Q2363102) (← links)
- Zero forcing sets and the minimum rank of graphs (Q2477541) (← links)
- On the difference between the maximum multiplicity and path cover number for tree-like graphs (Q2568981) (← links)
- Compressed cliques graphs, clique coverings and positive zero forcing (Q2636506) (← links)
