Positive semidefinite maximum nullity and zero forcing number

DOI10.13001/1081-3810.1559MaRDI QIDQ3166908zbMATH OpenOpenAlexFDO

Authors Travis Peters

Publication date 1 November 2012

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

Full work available at URL https://lib.dr.iastate.edu/etd/12432, http://www.math.technion.ac.il/iic/ela/ela-articles/articles/vol23_pp815-830.pdf

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

maximum nullityminimum rankpositive semidefinitesymmetric matriceszero forcing number

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vector spaces, linear dependence, rank, lineability (15A03) Hermitian, skew-Hermitian, and related matrices (15B57)

Recommendations

• Zero forcing parameters and minimum rank problems
• On minimum rank and zero forcing sets of a graph
• Positive semidefinite zero forcing
• Minimum rank, maximum nullity and zero forcing number for selected graph families
• Zero forcing sets and the minimum rank of graphs

Cited in

(30)

• Families of graphs with maximum nullity equal to zero forcing number
• Upper bounds for positive semidefinite propagation time
• Zero forcing and maximum nullity for hypergraphs
• Corrigendum to: ``Achievable multiplicity partitions in the inverse eigenvalue problem of a graph
• Achievable multiplicity partitions in the inverse eigenvalue problem of a graph
• Positive semidefinite zero forcing numbers of two classes of graphs
• Generalizations of the strong Arnold property and the minimum number of distinct eigenvalues of a graph
• Positive semidefinite zero forcing
• Maximum nullity and zero forcing of circulant graphs
• Line graphs: their maximum nullities and zero forcing numbers.
• Using a new zero forcing process to guarantee the strong Arnold property
• Fractional zero forcing via three-color forcing games
• Note on positive semidefinite maximum nullity and positive semidefinite zero forcing number of partial 2-trees
• Using variants of zero forcing to bound the inertia set of a graph
• Positive zero forcing and edge clique coverings
• A new lower bound for positive zero forcing
• Tight frame graphs arising as line graphs
• Connected zero forcing sets and connected propagation time of graphs
• Tree cover number and maximum semidefinite nullity of some graph classes
• Maximum nullity and zero forcing number of graphs with rank at most 4
• The maximum nullity of a complete subdivision graph is equal to its zero forcing number
• On the complexity of the positive semidefinite zero forcing number
• The \(q\)-analogue of zero forcing for certain families of graphs
• Minimum rank, maximum nullity and zero forcing number for selected graph families
• Sparks of symmetric matrices and their graphs
• Leaky positive semidefinite forcing on graphs
• Zero and total forcing dense graphs
• Positive semidefinite propagation time
• On minimum rank and zero forcing sets of a graph
• Zero forcing parameters and minimum rank problems

This page was built for publication: Positive semidefinite maximum nullity and zero forcing number

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