publication . Article . 2012

computing inertia sets using atoms

Barrett, Wayne; Butler, Steve; Hall, H. Tracy; Sinkovic, John; So, Wasin; Starr, Colin; Yielding, Amy;
Open Access
  • Published: 01 Jun 2012 Journal: Linear Algebra and its Applications, volume 436, pages 4,489-4,502 (issn: 0024-3795, Copyright policy)
  • Publisher: Elsevier BV
Abstract
AbstractWe consider the problem of computing inertia sets for graphs. By using tools for combining the inertia sets of smaller graphs we can reduce this problem to understanding the inertia sets for three-connected graphs that are not joins. We term such graphs atoms and give the inertia sets for all atoms on at most seven vertices. This can be used to compute the inertia sets for all graphs on at most seven vertices.
Subjects
arXiv: Computer Science::Databases
ACM Computing Classification System: MathematicsofComputing_DISCRETEMATHEMATICSComputingMethodologies_COMPUTERGRAPHICSMathematicsofComputing_NUMERICALANALYSISComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATION
free text keywords: Geometry and Topology, Algebra and Number Theory, Numerical Analysis, Discrete Mathematics and Combinatorics, Vertex (geometry), Joins, Atom, Graph, Mathematics, Combinatorics, Inertia, media_common.quotation_subject, media_common, Symmetric matrix, 15A03, 05C50, Atoms, Minimum rank problem, Inverse inertia problem, Symmetric matrices
Related Organizations
Powered by OpenAIRE Open Research Graph
Any information missing or wrong?Report an Issue
publication . Article . 2012

computing inertia sets using atoms

Barrett, Wayne; Butler, Steve; Hall, H. Tracy; Sinkovic, John; So, Wasin; Starr, Colin; Yielding, Amy;