Propagation tree decompositions and linearly independent vertices

DOI10.1016/J.TCS.2020.10.016MaRDI QIDQ2215974zbMATH OpenOpenAlexFDO

Authors Lon H. Mitchell

Publication date 15 December 2020

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

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

zbMATH Keywords

minimum semidefinite rankOS-setspropagation tree decompositionszero-forcing

Mathematics Subject Classification ID

Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Trees with a unique maximum independent set and their linear properties
• Tree sets
• scientific article; zbMATH DE number 2188478
• Tree-decompositions of graphs. I
• Generation of trees of a graph with the use of decomposition

Cites work

• Graph theory
• Linearly independent vertices and minimum semidefinite rank
• Positive semidefinite zero forcing numbers of two classes of graphs
• Zero forcing parameters and minimum rank problems

This page was built for publication: Propagation tree decompositions and linearly independent vertices

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