Abstract Tree‐width, and variants that restrict the allowable tree decompositions, play an important role in the study of graph algorithms and have application to computer science. The zero forcing number is used to study the maximum nullity/minimum rank of the family of symmetric matrices described...
Research Assistant
AI chat, annotations, notes & similar papers
No comments yet
Be the first to share your thoughts!