Nullity of a graph in terms of path cover number

DOI10.1080/03081087.2019.1649632MaRDI QIDQ4959297zbMATH OpenOpenAlexFDO

Authors

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

zbMATH Keywords

ranknullitypath cover number

Mathematics Subject Classification ID

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)

Recommendations

• On the nullity number of graphs
• Nullity of graphs
• Nullity of graphs
• Maximum nullity of outerplanar graphs and the path cover number
• On the nullity of graphs
• Nullity of a graph in terms of its domination number.
• 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
• Nullity of graphs: an updated survey
• Remarks on the nullity of graphs

Cites work

• scientific article; zbMATH DE number 6100973 (Why is no real title available?)
• scientific article; zbMATH DE number 5578782 (Why is no real title available?)
• scientific article; zbMATH DE number 3414355 (Why is no real title available?)
• A characterization of graphs \(G\) with nullity \(|V(G)|-2m(G)+2c(G)\)
• A characterization of long graphs of arbitrary 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
• An upper bound of the nullity of a graph in terms of order and maximum degree
• Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank
• Characterization of graphs whose signature equals the number of odd cycles
• 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
• On the characterization of graphs with pendent vertices and given nullity
• On the construction of graphs of nullity one
• On the null-spaces of acyclic and unicyclic singular graphs
• On the nullity and the matching number of unicyclic graphs
• On the nullity of a graph with cut-points
• On the nullity of bicyclic graphs
• On the nullity of bipartite graphs
• On the nullity of bipartite graphs
• On the nullity of graphs
• On the nullity of graphs with pendant trees
• On the nullity of line graphs of trees
• On the nullity of the line graph of unicyclic graph with depth one
• On the nullity of tricyclic graphs
• On the nullity of unicyclic graphs
• On the trees with maximum nullity
• Relation between the skew-rank of an oriented graph and the rank of its underlying graph
• Signed graphs with cut points whose positive inertia indexes are two
• Skew-rank of an oriented graph in terms of matching number
• Spektren endlicher Grafen
• The nullity of (k-1)-cyclic graphs
• The nullity of \(k\)-cyclic graphs of \(\infty\)-type
• The positive and the negative inertia index of line graphs of trees
• Trees with maximum nullity

Cited in

(4)

• Maximum nullity of outerplanar graphs and the path cover number
• Nullity of corona of a path with Smith graphs
• Nullity of a graph in terms of the dimension of cycle space and the number of pendant vertices
• Geometric vs algebraic nullity for hyperpaths

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)