Relationships between minimum rank problem parameters for cobipartite graphs

DOI10.1016/J.DAM.2025.12.022MaRDI QIDQ6866639zbMATH OpenFDO

Authors L. Deaett, D. Young

Publication date 28 January 2026

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DAM.2025.12.022

zbMATH Keywords

inverse eigenvalue problemmatrix patternmaximum nullityminimum rankzero forcing

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Cites work

• Computation of minimal rank and path cover number for certain graphs
• Matroids and the minimum rank problem for matrix patterns
• Minimum ranks of sign patterns and zero-nonzero patterns and point-hyperplane configurations
• Odd cycle zero forcing parameters and the minimum rank of graph blowups
• On the minimum rank of not necessarily symmetric matrices: A preliminary study
• On the possible ranks among matrices with a given pattern
• Parameters related to tree-width, zero forcing, and maximum nullity of a graph
• Propagation time for zero forcing on a graph
• Ranks of zero patterns and sign patterns^*
• Spectral graph theory and the inverse eigenvalue problem of a graph
• The extent to which triangular sub-patterns explain minimum rank
• The minimum rank of symmetric matrices described by a graph: a survey
• The relationship between maximum triangle size and minimum rank for zero-nonzero patterns
• Vertex and edge spread of zero forcing number, maximum nullity, and minimum rank of a graph
• Zero forcing parameters and minimum rank problems
• Zero forcing sets and the minimum rank of graphs

This page was built for publication: Relationships between minimum rank problem parameters for cobipartite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6866639)