Maximum nullity of outerplanar graphs and the path cover number
DOI10.1016/J.LAA.2009.08.033zbMATH Open1201.05061OpenAlexW2151143642MaRDI QIDQ848586FDOQ848586
Authors: John Sinkovic 
Publication date: 4 March 2010
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2009.08.033
Recommendations
- Path cover number, maximum nullity, and zero forcing number of oriented graphs and other simple digraphs
- Nullity of a graph in terms of path cover number
- Maximal outerplanar graphs with perfect face-independent vertex covers
- Nontrivial path covers of graphs: existence, minimization and maximization
- scientific article; zbMATH DE number 3878973
- Total domination in maximal outerplanar graphs
- Partial domination of maximal outerplanar graphs
- Bounds for the connected domination number of maximal outerplanar graphs
- Tree cover number and maximum semidefinite nullity of some graph classes
- On dominating sets of maximal outerplanar graphs
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Hermitian, skew-Hermitian, and related matrices (15B57) Planar graphs; geometric and topological aspects of graph theory (05C10) Vector spaces, linear dependence, rank, lineability (15A03)
Cites Work
- Computation of minimal rank and path cover number for certain graphs
- The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree
- The maximum corank of graphs with a 2-separation
- A characterization of tridiagonal matrices
- Minimum-rank matrices with prescribed graph
- On the difference between the maximum multiplicity and path cover number for tree-like graphs
- Three-connected graphs whose maximum nullity is at most three
Cited In (9)
- Signed graphs with stable maximum nullity at most two
- Minimum rank of outerplanar graphs
- Families of graphs with maximum nullity equal to zero forcing number
- Vertex and edge spread of zero forcing number, maximum nullity, and minimum rank of a graph
- Nullity of a graph in terms of path cover number
- Tree cover number and maximum semidefinite nullity of some graph classes
- Nullspace embeddings for outerplanar graphs
- Zero forcing parameters and minimum rank problems
- Signed graphs with maximum nullity two
This page was built for publication: Maximum nullity of outerplanar graphs and the path cover number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q848586)
