The inertia set of the join of graphs

DOI10.1016/J.LAA.2010.12.022zbMATH Open1227.05178OpenAlexW2163088586MaRDI QIDQ632470FDOQ632470

Authors: H. Tracy Hall, Hein van der Holst, Wayne Barrett 

Publication date: 25 March 2011

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

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

Recommendations

• Inertia and biclique decompositions of joins of graphs
• Inertia sets of semicliqued graphs
• The inertia sets of graphs with a 2-separation
• The inertia set of a signed graph
• Bounding the inertia of graphs under some graph operations
• Inertia sets for graphs on six or fewer vertices
• On the inertia set of a signed graph with loops
• The inertia of distance matrices of some graphs
• scientific article; zbMATH DE number 1539536
• The inertia of unicyclic graphs and bicyclic graphs

zbMATH Keywords

inertiasymmetric matricesjoin of graphsminimum rank problemcombinatorial matrix theory

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Hermitian, skew-Hermitian, and related matrices (15B57)

Cites Work

• The inverse inertia problem for graphs: Cut vertices, trees, and a counterexample
• The minimum rank of symmetric matrices described by a graph: a survey
• Inertia sets for graphs on six or fewer vertices
• Graphs whose minimal rank is two
• Linearly independent vertices and minimum semidefinite rank
• On the minimum rank of the join of graphs and decomposable graphs
• Title not available (Why is that?)

Cited In (14)

• Graphs that allow all the eigenvalue multiplicities to be even
• Achievable multiplicity partitions in the inverse eigenvalue problem of a graph
• On the null space of a Colin de Verdière matrix
• Computing inertia sets using atoms
• On the inertia set of a signed graph with loops
• Inertia sets for graphs on six or fewer vertices
• Bounding the inertia of graphs under some graph operations
• The inverse inertia problem for graphs: Cut vertices, trees, and a counterexample
• The maximum of the minimal multiplicity of eigenvalues of symmetric matrices whose pattern is constrained by a graph
• Corrigendum to: ``Achievable multiplicity partitions in the inverse eigenvalue problem of a graph
• The inertia sets of graphs with a 2-separation
• Orthogonal symmetric matrices and joins of graphs
• Inertia sets of semicliqued graphs
• Inertia and biclique decompositions of joins of graphs

This page was built for publication: The inertia set of the join of graphs

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