Odd Cycle Zero Forcing Parameters and the Minimum Rank of Graph Blowups

DOI10.13001/1081-3810.2836zbMath1333.05184OpenAlexW2283500301MaRDI QIDQ2794394

Jephian C.-H. Lin

Publication date: 10 March 2016

Published in: The Electronic Journal of Linear Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.13001/1081-3810.2836

zbMATH Keywords

blowupminimum rankmaximum nullityzero forcing numbergraph complement conjectureloop graphenhanced odd cycle zero forcing numberodd cycle zero forcing number

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Hermitian, skew-Hermitian, and related matrices (15B57) Vector spaces, linear dependence, rank, lineability (15A03) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (3)

Using a new zero forcing process to guarantee the strong Arnold property ⋮ Zero forcing number, Grundy domination number, and their variants ⋮ A zero forcing technique for bounding sums of eigenvalue multiplicities

Cites Work

• Unnamed Item
• On the graph complement conjecture for minimum rank
• Minimum rank problems
• Techniques for determining the minimum rank of a small graph
• Zero forcing parameters and minimum rank problems
• Computation of minimal rank and path cover number for certain graphs
• Positive semidefinite zero forcing
• Zero forcing sets and the minimum rank of graphs
• The minimum rank problem over finite fields
• On the minimum rank of not necessarily symmetric matrices: A preliminary study
• Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph
• Minimum rank with zero diagonal

This page was built for publication: Odd Cycle Zero Forcing Parameters and the Minimum Rank of Graph Blowups