Frustration and isoperimetric inequalities for signed graphs

DOI10.1016/j.dam.2016.09.015zbMath1358.05133OpenAlexW2549285228MaRDI QIDQ516822

Florian Martin

Publication date: 15 March 2017

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2016.09.015

zbMATH Keywords

spectral graph theorysigned graphsmonotone systemsbalanced graphsfrustration indexsigned Laplacian

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Connectivity (05C40) Signed and weighted graphs (05C22)

Related Items (4)

A modeling and computational study of the frustration index in signed networks ⋮ Signed bicyclic graphs minimizing the least Laplacian eigenvalue ⋮ Spectra of signed graphs ⋮ Lower bounds for the least Laplacian eigenvalue of unbalanced blocks

Cites Work

• Unnamed Item
• An isoperimetric constant for signed graphs
• Lifts, discrepancy and nearly optimal spectral gap
• Balanced decompositions of a signed graph
• Isoperimetric inequalities, growth, and the spectrum of graphs
• Signed graphs
• A simple algorithm to detect balance in signed graphs
• Interlacing families. II: Mixed characteristic polynomials and the Kadison-Singer problem
• Balancedness and the least eigenvalue of Laplacian of signed graphs
• Bounds for the least Laplacian eigenvalue of a signed graph
• On the notion of balance of a signed graph
• A Cheeger Inequality for the Graph Connection Laplacian
• Optimal Edge Deletions for Signed Graph Balancing

This page was built for publication: Frustration and isoperimetric inequalities for signed graphs