Independence and matching numbers of unicyclic graphs from null space
From MaRDI portal
Publication:2176213
DOI10.1007/s40314-020-1090-3zbMath1449.05165arXiv1907.07650OpenAlexW3005810042MaRDI QIDQ2176213
Vilmar Trevisan, Luiz Emilio Allem, Maikon Machado Toledo, Gonzalo Molina, Daniel A. Jaume
Publication date: 4 May 2020
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1907.07650
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)
Related Items (2)
On the structure of the inverse of non-singular unicyclic graphs ⋮ Null decomposition of unicyclic graphs
Cites Work
- Unnamed Item
- Unnamed Item
- On the independence number of random graphs
- A note on the independence number of triangle-free graphs
- The monotone circuit complexity of Boolean functions
- Approximating the independence number via the \(\vartheta\)-function
- Null decomposition of trees
- TWO THEOREMS IN GRAPH THEORY
- Reducibility among Combinatorial Problems
- A relation between the matching number and Laplacian spectrum of a graph
- On the nullity of graphs with pendant trees
This page was built for publication: Independence and matching numbers of unicyclic graphs from null space