On the tree cover number of a graph

DOI10.2140/involve.2017.10.767zbMath1364.05022OpenAlexW2615102243MaRDI QIDQ2357664

Oscar E. González, Brendan Cook, Chassidy Bozeman, Carolyn Reinhart, Minerva Catral

Publication date: 14 June 2017

Published in: Involve (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/5d3504043dbe1d99910bbd0d55f741f1a7b9cb3e

zbMATH Keywords

hypercubeminimum rankmaximum nullitytree cover number

Mathematics Subject Classification ID

Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• The minimum rank of symmetric matrices described by a graph: a survey
• On the minimum semidefinite rank of a simple graph
• Minimum semidefinite rank of outerplanar graphs and the tree cover number
• Note on positive semidefinite maximum nullity and positive semidefinite zero forcing number of partial 2-trees
• On the maximum positive semi-definite nullity and the cycle matroid of graphs

This page was built for publication: On the tree cover number of a graph