Biased graphs. I: Bias, balance, and gains
From MaRDI portal
Publication:750468
DOI10.1016/0095-8956(89)90063-4zbMath0714.05057OpenAlexW2063835992MaRDI QIDQ750468
Publication date: 1989
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(89)90063-4
Related Items
Characterizations of line graphs in signed and gain graphs, Matroids arising from electrical networks, Unit gain graphs with two distinct eigenvalues and systems of lines in complex space, Unbalanced signed graphs with extremal spectral radius or index, The projective-planar signed graphs, Matrix representations of frame and lifted-graphic matroids correspond to gain functions, Symmetry-forced rigidity of frameworks on surfaces, Enumeration of extensions of the cycle matroid of a complete graph, Pancyclicity in switching classes, Bicircular matroids representable over \(\mathrm{GF}(4)\) or \(\mathrm{GF}(5)\), Matroids of gain graphs in applied discrete geometry, Dowling group geometries and the critical problem, Representations of bicircular lift matroids, Negative (and positive) circles in signed graphs: a problem collection, On cospectrality of gain graphs, The excluded minors for the class of matroids that are graphic or bicircular lift, Bounding and stabilizing realizations of biased graphs with a fixed group, A Generalisation of the Matroid Lift Construction, Complex unit gain bicyclic graphs with rank 2, 3 or 4, The biased graphs whose matroids are binary, Resolution of indecomposable integral flows on signed graphs, Inertia of complex unit gain graphs, Complex unit gain graphs of rank 2, When does a biased graph come from a group labelling?, A short proof of Shih's isomorphism theorem on graphic subspaces, On the Dowling and Rhodes lattices and wreath products, Integer functions on the cycle space and edges of a graph, On the determinant of the Laplacian matrix of a complex unit gain graph, Automorphisms of Dowling Lattices and Related Geometries, Cellular automorphisms and self-duality, Frame matroids, toric ideals, and a conjecture of White, Biased expansions of biased graphs and their chromatic polynomials, Unnamed Item, Oriented hypergraphs: introduction and balance, Six signed Petersen graphs, and their automorphisms, Graphical representations of graphic frame matroids, Cluster Consensus with Point Group Symmetries, Spectral properties of complex unit gain graphs, Enumeration of Flats of the Extended Catalan and Shi Arrangements with Species, On Recognizing Frame and Lifted‐Graphic Matroids, Clones in 3-connected frame matroids, Biased graphs IV: Geometrical realizations, Modular construction of free hyperplane arrangements, A reciprocal eigenvalue property for unicyclic weighted directed graphs with weights from \(\{\pm 1,{\pm}i\}\), On the Number of Biased Graphs, Circuit covers of signed Eulerian graphs, Biased graphs. II: The three matroids, Unnamed Item, Graph covers with two new eigenvalues, Rigidity of symmetric frameworks in normed spaces, Associativity in multiary quasigroups: The way of biased expansions, Gain-line graphs via \(G\)-phases and group representations, Balance in gain graphs - a spectral analysis, A modular triple characterization of circuit signatures, Gain distance matrices for complex unit gain graphs, Displaying blocking pairs in signed graphs, Doubly transitive lines. I: Higman pairs and roux, Laplacian matrices of general complex weighted directed graphs, Dimensional reduction for generalized continuum polymers, On excluded minors for classes of graphical matroids, Biased graphs with no two vertex-disjoint unbalanced cycles, Motions of grid-like reflection frameworks, Locating eigenvalues of unbalanced unicyclic signed graphs, Connectivity in frame matroids, Spectra of quaternion unit gain graphs, Finding a shortest non-zero path in group-labeled graphs via permanent computation, Counter machines and crystallographic structures, Bias matroids with unique graphical representations, Disjoint non-balanced \(A\)-paths in biased graphs, Bounds for the extremal eigenvalues of gain Laplacian matrices, Signed bicyclic graphs minimizing the least Laplacian eigenvalue, Infinitely many excluded minors for frame matroids and for lifted-graphic matroids, On two Laplacian matrices for skew gain graphs, Vertices of Localized Imbalance in a Biased Graph, Linear codes over signed graphs, Oriented gain graphs, line graphs and eigenvalues, Excluding a group-labelled graph, Totally frustrated states in the chromatic theory of gain graphs, A group representation approach to balance of gain graphs, Balancedness and the least Laplacian eigenvalue of some complex unit gain graphs, On the Falk invariant of Shi and linial arrangements, Describing quasi-graphic matroids, A characterization of oriented hypergraphic balance via signed weak walks, Biased graphs whose matroids are special binary matroids, Single Commodity-Flow Algorithms for Lifts of Graphic and CoGraphic Matroids, Free idempotent generated semigroups: the word problem and structure via gain graphs, Spectral fundamentals and characterizations of signed directed graphs, A new matroid lift construction and an application to group-labeled graphs, Biased graphs. VI: Synthetic geometry, The graphs that have antivoltages using groups of small order, Unbalanced unicyclic and bicyclic graphs with extremal spectral radius, A characterization of jointless Dowling geometries, Supersolvable frame-matroid and graphic-lift lattices, Extremal spectral results related to spanning trees of signed complete graphs, Dowling geometries representable over rings, On the Falk invariant of hyperplane arrangements attached to gain graphs, Signed graphs with extremal least Laplacian eigenvalue, Inductive constructions for frameworks on a two-dimensional fixed torus, Gain-sparsity and symmetry-forced rigidity in the plane, Families of fixed-point cellular rotations, Unnamed Item, Generic Symmetry-Forced Infinitesimal Rigidity: Translations and Rotations, On the relation between the adjacency rank of a complex unit gain graph and the matching number of its underlying graph, On the adjacency matrix of a complex unit gain graph, On the structure of matroids arising from the gain graphs, Root polytopes and Jaeger‐type dissections for directed graphs, On bounds of \(A_\alpha\)-eigenvalue multiplicity and the rank of a complex unit gain graph, Tree automata and pigeonhole classes of matroids. II, The spectral property of hypergraph coverings, Signed distance Laplacian matrices for signed graphs, Limit points for the spectral radii of signed graphs, Cobiased graphs: single-element extensions and elementary quotients of graphic matroids, A switching method for constructing cospectral gain graphs, On connected \(\mathbb{T}\)-gain graphs with rank equal to girth, Unnamed Item, Unnamed Item, The Unbreakable Frame Matroids, Unnamed Item, A Ramsey Theorem for Biased Graphs, Unnamed Item, GRAPHS DETERMINED BY THEIR -GAIN SPECTRA
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On local balance and \(n\)-balance in signed graphs
- The biased graphs whose matroids are binary
- Signed graphs
- Signed graph coloring
- Chromatic invariants of signed graphs
- Biased graphs. II: The three matroids
- On matroids on edge sets of graphs with connected subgraphs as circuits. II
- Matroids from directed graphs
- Biased graphs. III: Chromatic and dichromatic invariants
- On subgraphs as matroid cells
- An interrelation between line graphs, eigenvalues, and matroids
- A class of geometric lattices based on finite groups
- On the notion of balance of a signed graph
- The Geometry of Root Systems and Signed Graphs
- Characterizations of signed graphs
- Lectures on matroids
