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

DOI10.1016/J.LAA.2006.05.020zbMATH Open1112.05061OpenAlexW2006666423MaRDI QIDQ869896FDOQ869896

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

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

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)

Cites Work

• Matrix Analysis
• Title not available (Why is that?)
• Title not available (Why is that?)
• Laplacian graph eigenvectors
• 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
• Graphs whose minimal rank is two
• The rank of a cograph
• A characterization of tridiagonal matrices
• Title not available (Why is that?)
• On the relative position of multiple eigenvalues in the spectrum of an Hermitian matrix with a given graph
• On the difference between the maximum multiplicity and path cover number for tree-like graphs
• Laplacian spectra and spanning trees of threshold graphs
• Graphs whose minimal rank is two: The finite fields case

Cited In (18)

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

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)