Vertices of Localized Imbalance in a Biased Graph

DOI10.2307/2046575zbMATH Open0622.05054OpenAlexW4248945451MaRDI QIDQ3758882FDOQ3758882

Authors: Thomas Zaslavsky 

Publication date: 1987

Full work available at URL: https://doi.org/10.2307/2046575

Recommendations

• Biased graphs. I: Bias, balance, and gains
• On the number of biased graphs
• Biased graphs with no two vertex-disjoint unbalanced cycles
• A Ramsey theorem for biased graphs
• Biased graphs. VI: Synthetic geometry

zbMATH Keywords

biased graphbalanced subgraph

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph theory (05C99)

Cites Work

• Title not available (Why is that?)
• Biased graphs. I: Bias, balance, and gains
• Biased graphs. II: The three matroids
• Erratum to: T. Zaslavsky, signed graphs
• Characterizations of signed graphs
• Biased graphs whose matroids are special binary matroids

Cited In (16)

• The 9-connected excluded minors for the class of quasi-graphic matroids
• Gain distance matrices for complex unit gain graphs
• Chordally signed graphs
• Biased graphs with no two vertex-disjoint unbalanced cycles
• Clones in 3-connected frame matroids
• Matrix representations of frame and lifted-graphic matroids correspond to gain functions
• Matroids arising from electrical networks
• On the number of biased graphs
• Negative (and positive) circles in signed graphs: a problem collection
• Decompositions of signed-graphic matroids
• The minimal \(\mathbb{Z}_n\)-symmetric graphs that are not \(\mathbb{Z}_n\)-spherical
• Biased graphs whose matroids are special binary matroids
• Connectivity in frame matroids
• The biased graphs whose matroids are binary
• Projective-planar signed graphs and tangled signed graphs
• Bounds for the extremal eigenvalues of gain Laplacian matrices

This page was built for publication: Vertices of Localized Imbalance in a Biased Graph

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