Spectral aspects of symmetric matrix signings

DOI10.4230/LIPIcs.MFCS.2019.81OpenAlexW2970525929MaRDI QIDQ5092445

Karthekeyan Chandrasekaran, Hsien-Chih Chang, Alexandra Kolla, Naonori Kakimura, Charles Carlson

Publication date: 21 July 2022

Full work available at URL: https://doi.org/10.4230/LIPIcs.MFCS.2019.81

zbMATH Keywords

matchingsspectral graph theorymatrix signing

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Signed and weighted graphs (05C22)

Cites Work

• Unnamed Item
• The minimum rank of symmetric matrices described by a graph: a survey
• Balancing signed graphs
• A simple algorithm to detect balance in signed graphs
• The optimal path-matching problem
• Relative expanders or weakly relatively Ramanujan graphs.
• Some criteria for a signed graph to have full rank
• On the notion of balance of a signed graph

This page was built for publication: Spectral aspects of symmetric matrix signings