Spectral aspects of symmetric matrix signings

DOI10.1016/J.DISOPT.2020.100582zbMATH Open1506.68068OpenAlexW3023748707MaRDI QIDQ783041FDOQ783041

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

Publication date: 30 July 2020

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2019/11025/

Recommendations

• Spectral aspects of symmetric matrix signings
• About the spectra of a real nonnegative matrix and its signings
• Computing the inertia from sign patterns
• Spectral properties of sign symmetric matrices
• On sign-symmetric signed graphs

zbMATH Keywords

spectral graph theorymatchingsmatrix signing

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Reducibility among combinatorial problems
• Signed graphs
• Interlacing families. I: Bipartite Ramanujan graphs of all degrees
• On the notion of balance of a signed graph
• Paths, Trees, and Flowers
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Combinatorial Nullstellensatz
• Partitions of nonzero elements of a finite field into pairs
• A generalization of combinatorial Nullstellensatz
• The Geometry of Root Systems and Signed Graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• The minimum rank of symmetric matrices described by a graph: a survey
• Optimal Edge Deletions for Signed Graph Balancing
• Title not available (Why is that?)
• Title not available (Why is that?)
• Relative expanders or weakly relatively Ramanujan graphs.
• A simple algorithm to detect balance in signed graphs
• Fractional matchings and the Edmonds-Gallai theorem
• Finding small stabilizers for unstable graphs
• The optimal path-matching problem
• The parity of the number of 1-factors of a graph
• Studies on the balancing, the minimal balancing, and the minimum balancing processes for social groups with planar and nonplanar graph structures
• Balancing signed graphs
• Some criteria for a signed graph to have full rank
• Integer and Fractional Matchings
• Title not available (Why is that?)

Cited In (2)

• About the spectra of a real nonnegative matrix and its signings
• Spectral aspects of symmetric matrix signings

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

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