Maximum frustration in bipartite signed graphs
From MaRDI portal
Publication:1953314
zbMath1266.05045MaRDI QIDQ1953314
Publication date: 7 June 2013
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v19i4p10
Related Items (2)
Bounds for the extremal eigenvalues of gain Laplacian matrices ⋮ Burnside chromatic polynomials of group-invariant graphs
Uses Software
This page was built for publication: Maximum frustration in bipartite signed graphs