Nullspace vertex partition in graphs
From MaRDI portal
Publication:2230734
DOI10.1007/s10878-020-00624-xzbMath1473.05187arXiv2001.04710OpenAlexW3044242934MaRDI QIDQ2230734
Irene Sciriha, Xandru Mifsud, James L. Borg
Publication date: 28 September 2021
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2001.04710
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eigenvalues, singular values, and eigenvectors (15A18)
Cites Work
- On the nullity of a graph with cut-points
- Tree decomposition by eigenvectors
- The second largest eigenvalue of a tree
- Combinatorial properties of the family of maximum stable sets of a graph
- On the construction of graphs of nullity one
- Null decomposition of trees
- Trees with maximum nullity
- On the displacement of eigenvalues when removing a twin vertex
- The least eigenvalue of signless Laplacian of graphs under perturbation
- More on Graph Perturbations
- A characterization of singular graphs
- Coalesced and embedded nut graphs in singular graphs
- Minimal configuration trees
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Nullspace vertex partition in graphs
