Positive semidefinite zero forcing numbers of two classes of graphs

DOI10.1016/J.TCS.2018.05.009MaRDI QIDQ2319902zbMATH OpenOpenAlexWikidataFDO

Authors Lusheng Wang, Boting Yang

Publication date 20 August 2019

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2018.05.009

zbMATH Keywords

minimum rankzero forcing numbermaximum positive semidefinite nullitypositive semidefinite zero forcing number

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• A new lower bound for positive zero forcing
• Positive semidefinite zero forcing: complexity and lower bounds
• Positive semidefinite zero forcing
• On the complexity of the positive semidefinite zero forcing number
• Lower bounds for positive semidefinite zero forcing and their applications

Cites work

• A new lower bound for the positive semidefinite minimum rank of a graph
• A technique for computing the zero forcing number of a graph with a cut-vertex
• Bounds for minimum semidefinite rank from superpositions and cutsets
• Compressed cliques graphs, clique coverings and positive zero forcing
• Fast edge searching and fast searching on graphs
• Fast-mixed searching and related problems on graphs
• Graph minors. III. Planar tree-width
• Hamilton Paths in Grid Graphs
• Line graphs: their maximum nullities and zero forcing numbers.
• Linearly independent vertices and minimum semidefinite rank
• Lower bounds for minimum semidefinite rank from orthogonal removal and chordal supergraphs
• Lower bounds for positive semidefinite zero forcing and their applications
• Matching theory
• Minimum semidefinite rank of outerplanar graphs and the tree cover number
• Nondiscriminatory propagation on trees
• Note on positive semidefinite maximum nullity and positive semidefinite zero forcing number of partial 2-trees
• On minimum rank and zero forcing sets of a graph
• On the Fast Searching Problem
• On the Minimum Rank Among Positive Semidefinite Matrices with a Given Graph
• On the complexity of the positive semidefinite zero forcing number
• Parameters related to tree-width, zero forcing, and maximum nullity of a graph
• Positive semidefinite maximum nullity and zero forcing number
• Positive semidefinite propagation time
• Positive semidefinite zero forcing
• 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

Cited in

(9)

• On the complexity of the positive semidefinite zero forcing number
• On the zero blocking number of rectangular, cylindrical, and Möbius grids
• Positive semidefiniteness of \(A_\alpha (G)\) on some families of graphs
• Blocking zero forcing processes in Cartesian products of graphs
• Positive semidefinite zero forcing
• Lower bounds for positive semidefinite zero forcing and their applications
• Propagation tree decompositions and linearly independent vertices
• The complexity of the positive semidefinite zero forcing
• Positive semidefinite zero forcing: complexity and lower bounds

This page was built for publication: Positive semidefinite zero forcing numbers of two classes of graphs

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