An improved lower bound for the nullity of a graph in terms of matching number
From MaRDI portal
Publication:5132620
DOI10.1080/03081087.2019.1567672zbMath1451.05142OpenAlexW2910180535WikidataQ114641302 ScholiaQ114641302MaRDI QIDQ5132620
Publication date: 12 November 2020
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03081087.2019.1567672
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Connectivity (05C40) Chemical graph theory (05C92)
Related Items (5)
Relation between the nullity of a graph and its matching number ⋮ The nullity of a graph with fractional matching number ⋮ The rank of a signed graph ⋮ Unnamed Item ⋮ Bounds for the rank of a complex unit gain graph in terms of its maximum degree
Cites Work
- Characterization of graphs with given order, given size and given matching number that minimize nullity
- Nullity of a graph in terms of the dimension of cycle space and the number of pendant vertices
- Characterization of graphs whose signature equals the number of odd cycles
- A characterization of graphs with rank 5
- On the nullity of the line graph of unicyclic graph with depth one
- A characterization of graphs \(G\) with nullity \(|V(G)|-2m(G)+2c(G)\)
- A characterization of graphs with rank 4
- On the nullity of tricyclic graphs
- On the nullity of a graph with cut-points
- Spectra of graphs
- On the relationship between the skew-rank of an oriented graph and the rank of its underlying graph
- Spektren endlicher Grafen
- On the nullity and the matching number of unicyclic graphs
- On the nullity of bicyclic graphs
- An upper bound of the nullity of a graph in terms of order and maximum degree
- The rank of a signed graph in terms of the rank of its underlying graph
- Signed graphs with cut points whose positive inertia indexes are two
- A characterization of long graphs of arbitrary rank
- The positive and the negative inertia index of line graphs of trees
- On the nullity of unicyclic graphs
- Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank
- A characterization of signed planar graphs with rank at most 4
- An upper bound for the nullity of a bipartite graph in terms of its maximum degree
- The nullity ofk-cyclic graphs of ∞-type
- Matrix Analysis
- On the relation between theH-rank of a mixed graph and the matching number of its underlying graph
- On the nullity of bipartite graphs
- On the nullity of bipartite graphs
- On the nullity of line graphs of trees
- Skew-rank of an oriented graph in terms of matching number
- Relation between the skew-rank of an oriented graph and the rank of its underlying graph
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: An improved lower bound for the nullity of a graph in terms of matching number
