Vertices of Localized Imbalance in a Biased Graph

DOI10.2307/2046575zbMath0622.05054OpenAlexW4248945451MaRDI QIDQ3758882

Thomas Zaslavsky

Publication date: 1987

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

zbMATH Keywords

biased graphbalanced subgraph

Mathematics Subject Classification ID

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

Related Items (14)

Chordally signed graphs ⋮ Matroids arising from electrical networks ⋮ Matrix representations of frame and lifted-graphic matroids correspond to gain functions ⋮ Negative (and positive) circles in signed graphs: a problem collection ⋮ Projective-planar signed graphs and tangled signed graphs ⋮ Decompositions of signed-graphic matroids ⋮ The biased graphs whose matroids are binary ⋮ The 9-Connected Excluded Minors for the Class of Quasi-graphic Matroids ⋮ Clones in 3-connected frame matroids ⋮ Gain distance matrices for complex unit gain graphs ⋮ Connectivity in frame matroids ⋮ The minimal \(\mathbb{Z}_n\)-symmetric graphs that are not \(\mathbb{Z}_n\)-spherical ⋮ Bounds for the extremal eigenvalues of gain Laplacian matrices ⋮ Biased graphs whose matroids are special binary matroids

Cites Work

• Biased graphs. I: Bias, balance, and gains
• Erratum to: T. Zaslavsky, signed graphs
• Biased graphs. II: The three matroids
• Biased graphs whose matroids are special binary matroids
• Characterizations of signed graphs
• Unnamed Item

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