Null decomposition of trees

DOI10.1016/j.disc.2017.11.019zbMath1378.05026arXiv1708.00934OpenAlexW2963693461MaRDI QIDQ1690257

Gonzalo Molina, Daniel A. Jaume

Publication date: 19 January 2018

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1708.00934

zbMATH Keywords

eigenvectorsindependence numbermatching numberindependent setsnull spacemaximum matchings

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) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (10)

On the structure of the inverse of non-singular unicyclic graphs ⋮ Independence and matching numbers of unicyclic graphs from null space ⋮ Trees with a unique maximum independent set and their linear properties ⋮ Combinatorial inversion in edge-weighted unicyclic graphs ⋮ Null decomposition of unicyclic graphs ⋮ On the core-nilpotent decomposition of trees ⋮ \(\lambda\)-core distance partitions ⋮ Null decomposition of bipartite graphs without cycles of length 0 modulo 4 ⋮ Nullspace vertex partition in graphs ⋮ A \(\{-1,0,1\}\)- and sparsest basis for the null space of a forest in optimal time

Cites Work

• The number of maximum matchings in a tree
• Tree decomposition by eigenvectors
• Graph partitioning by eigenvectors
• The second largest eigenvalue of a tree
• An introduction to matching polynomials
• Null space structure of tree-patterned matrices
• Trees with maximum nullity
• Algebraic matching theory
• Inverses of triangular matrices and bipartite graphs
• On the theory of the matching polynomial
• Eigenvectors of acyclic matrices
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Null decomposition of trees