On the minimum rank of the join of graphs and decomposable graphs

DOI10.1016/J.LAA.2006.05.020MaRDI QIDQ869896zbMATHOpenAlexFDO

Authors Francesco Barioli, Shaun M. Fallat

Publication date 9 March 2007

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.laa.2006.05.020

zbMATH Keywords

cographsmaximum multiplicityinertia-balanced

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Vector spaces, linear dependence, rank, lineability (15A03)

Recommendations

• Decompositions of minimum rank matrices
• The minimum rank of symmetric matrices described by a graph: a survey
• Inertia and biclique decompositions of joins of graphs
• On the graph complement conjecture for minimum rank
• The inverse eigenvalue and inertia problems for minimum rank two graphs

Cites work

• scientific article; zbMATH DE number 3436193 (Why is no real title available?)
• scientific article; zbMATH DE number 1557063 (Why is no real title available?)
• scientific article; zbMATH DE number 802915 (Why is no real title available?)
• A characterization of tridiagonal matrices
• Computation of minimal rank and path cover number for certain graphs
• Graphs whose minimal rank is two
• Graphs whose minimal rank is two: The finite fields case
• Laplacian graph eigenvectors
• Laplacian spectra and spanning trees of threshold graphs
• Matrix Analysis
• On the difference between the maximum multiplicity and path cover number for tree-like graphs
• On the relative position of multiple eigenvalues in the spectrum of an Hermitian matrix with a given graph
• The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree
• The rank of a cograph

Cited in

(21)

• Inertia and biclique decompositions of joins of graphs
• Computing inertia sets using atoms
• On the graph complement conjecture for minimum rank
• Minimum rank of skew-symmetric matrices described by a graph
• The Colin de Verdière number and joins of graphs
• The minimum rank of matrices and the equivalence class graph
• The inverse inertia problem for graphs: Cut vertices, trees, and a counterexample
• Bordering of symmetric matrices and an application to the minimum number of distinct eigenvalues for the join of graphs
• Computational and Theoretical Challenges for Computing the Minimum Rank of a Graph
• On acyclic and unicyclic graphs whose minimum rank equals the diameter
• Orthogonal symmetric matrices and joins of graphs
• Decompositions of minimum rank matrices
• Graphs whose adjacency matrices have rank equal to the number of distinct nonzero rows
• The minimum rank of symmetric matrices described by a graph: a survey
• The maximum multiplicity of the largest \(k\)-th eigenvalue in a matrix whose graph is acyclic or unicyclic
• Linearly independent vertices and minimum semidefinite rank
• Critical ideals, minimum rank and zero forcing number
• On the minimum semidefinite rank of a simple graph
• On the minimum hybrid rank of a graph relative to a partition of its edges and its application to electrical network analysis
• Graphs with real algebraic co-rank at most two
• The inertia set of the join of graphs

This page was built for publication: On the minimum rank of the join of graphs and decomposable graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q869896)