Nullity of a graph in terms of path cover number
DOI10.1080/03081087.2019.1649632zbMATH Open1472.05101OpenAlexW2965311308MaRDI QIDQ4959297FDOQ4959297
Author name not available (Why is that?)
Publication date: 13 September 2021
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03081087.2019.1649632
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Trees with maximum nullity
- A characterization of long graphs of arbitrary rank
- 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
- Characterization of graphs with given order, given size and given matching number that minimize nullity
- 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)\)
- On the nullity of bipartite graphs
- On the nullity of bipartite graphs
- On the nullity of line graphs of trees
- On the nullity of tricyclic graphs
- On the nullity of a graph with cut-points
- Spektren endlicher Grafen
- On the nullity and the matching number of unicyclic graphs
- On the nullity of bicyclic graphs
- The nullity of \((k-1)\)-cyclic graphs
- Nullity of a graph in terms of the dimension of cycle space and the number of pendant vertices
- On the nullity of graphs with pendant trees
- Characterization of graphs whose signature equals the number of odd cycles
- The nullity ofk-cyclic graphs of β-type
- On the construction of graphs of nullity one
- On the null-spaces of acyclic and unicyclic singular graphs
- On the nullity of graphs
- The positive and the negative inertia index of line graphs of trees
- A characterization of signed planar graphs with rank at most 4
- 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
- An upper bound of the nullity of a graph in terms of order and maximum degree
- An upper bound for the nullity of a bipartite graph in terms of its maximum degree
- Signed graphs with cut points whose positive inertia indexes are two
Cited In (2)
Recommendations
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- Path cover number, maximum nullity, and zero forcing number of oriented graphs and other simple digraphs π π
- Nullity of a graph in terms of the dimension of cycle space and the number of pendant vertices π π
- On the nullity number of graphs π π
- Nullity of graphs: an updated survey π π
- On the nullity of graphs π π
- Maximum nullity of outerplanar graphs and the path cover number π π
- Nullity of Graphs π π
This page was built for publication: Nullity of a graph in terms of path cover number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4959297)