Maximum nullity of outerplanar graphs and the path cover number

DOI10.1016/J.LAA.2009.08.033MaRDI QIDQ848586zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

graphminimum rankouterplanarpartial 2-pathpath cover numbersymmetric

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vector spaces, linear dependence, rank, lineability (15A03) Eigenvalues, singular values, and eigenvectors (15A18) Hermitian, skew-Hermitian, and related matrices (15B57)

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

Cites work

• A characterization of tridiagonal matrices
• Computation of minimal rank and path cover number for certain graphs
• Minimum-rank matrices with prescribed graph
• On the difference between the maximum multiplicity and path cover number for tree-like graphs
• The maximum corank of graphs with a 2-separation
• The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree
• Three-connected graphs whose maximum nullity is at most three

Cited in

(9)

• Families of graphs with maximum nullity equal to zero forcing number
• Signed graphs with stable maximum nullity at most two
• Minimum rank of outerplanar graphs
• Vertex and edge spread of zero forcing number, maximum nullity, and minimum rank of a graph
• Nullspace embeddings for outerplanar graphs
• Nullity of a graph in terms of path cover number
• Tree cover number and maximum semidefinite nullity of some graph classes
• Signed graphs with maximum nullity two
• Zero forcing parameters and minimum rank problems

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)