Signed graphs

DOI10.1016/0166-218X(82)90033-6zbMath0476.05080OpenAlexW4210751359WikidataQ56551379 ScholiaQ56551379MaRDI QIDQ1160198

Publication date: 1982

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

Full work available at URL: https://doi.org/10.1016/0166-218x(82)90033-6

zbMATH Keywords

signed graph matroidal families subgraphs as matroids

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Graph theory (05C99)

Related Items (only showing first 100 items - show all)

A Gram classification of non-negative corank-two loop-free edge-bipartite graphs ⋮ Signed graphs and the freeness of the Weyl subarrangements of type \(B_\ell\) ⋮ Coloring signed graphs using DFS ⋮ Nowhere-zero integral chains and flows in bidirected graphs ⋮ Combinatorial characterization of the null spaces of symmetric H-matrices ⋮ Free energy of \(\widehat{D_n}\) quiver Chern-Simons theories ⋮ Dowling group geometries and the critical problem ⋮ A Gram classification of principal Cox-regular edge-bipartite graphs via inflation algorithm ⋮ A polynomial recognition of unit forms using graph-based strategies ⋮ On the Falk invariant of signed graphic arrangements ⋮ Characteristic flows on signed graphs and short circuit covers ⋮ On eigenspaces of some compound signed graphs ⋮ Uniform convergence for signed networks under directed switching topologies ⋮ Spectral characterizations of signed cycles ⋮ A generalization of semimodular supersolvable lattice ⋮ Non-broken circuits of reflection groups and factorization in \(D_ n\) ⋮ A heuristic based on negative chordless cycles for the maximum balanced induced subgraph problem ⋮ Graph invertibility and median eigenvalues ⋮ Antistrong digraphs ⋮ Flexibility of projective-planar embeddings ⋮ A complexity dichotomy for signed \(\mathbf{H}\)-colouring ⋮ The biased graphs whose matroids are binary ⋮ A method of enumeration of negative cycles of a signed graph ⋮ Subspaces with well-scaled frames ⋮ Edges and vertices in a unique signed circle in a signed graph ⋮ Short signed circuit covers of signed graphs ⋮ A note on the nullity of unicyclic signed graphs ⋮ Oriented hypergraphs: introduction and balance ⋮ Hyperoctahedral Eulerian idempotents, Hodge decompositions, and signed graph coloring complexes ⋮ Signed graphs whose signed Colin de Verdière parameter is two ⋮ Balanced group-labeled graphs ⋮ Six signed Petersen graphs, and their automorphisms ⋮ Intrinsically linked signed graphs in projective space ⋮ The chromatic number of a signed graph ⋮ Combinatorial geometries representable over GF(3) and GF(q). I: The number of points ⋮ The structure of bases in bicircular matroids ⋮ Which exterior powers are balanced? ⋮ Biased graphs IV: Geometrical realizations ⋮ Combinatorial geometries representable over GF(3) and GF(q). II: Dowling geometries ⋮ On the achromatic number of signed graphs ⋮ Signed graph coloring ⋮ Finite-time and fixed-time bipartite consensus of multi-agent systems under a unified discontinuous control protocol ⋮ Circular flow on signed graphs ⋮ Extracting pure network submatrices in linear programs using signed graphs. ⋮ Chromatic invariants of signed graphs ⋮ Biased graphs. II: The three matroids ⋮ Orientation of signed graphs ⋮ Representations of bicircular matroids ⋮ Characterization of the maximum genus of a signed graph ⋮ Balance in gain graphs - a spectral analysis ⋮ Applications of matrix morsifications to Coxeter spectral study of loop-free edge-bipartite graphs ⋮ Zeta functions of edge-free quotients of graphs ⋮ Distance constraints on short cycles for 3-colorability of planar graphs ⋮ A colourful path to matrix-tree theorems ⋮ Motions of grid-like reflection frameworks ⋮ Iterated local transitivity model for signed social networks ⋮ Coordination of multi-agent systems on interacting physical and communication topologies ⋮ Degree choosable signed graphs ⋮ The signed-graphic representations of wheels and whirls ⋮ Constructing signed strongly regular graphs via star complement technique ⋮ Frustration and isoperimetric inequalities for signed graphs ⋮ Basic derivations for subarrangements of Coxeter arrangements ⋮ Inflation algorithm for loop-free non-negative edge-bipartite graphs of corank at least two ⋮ Falk invariants of signed graphic arrangements ⋮ A remark on eigen values of signed graph ⋮ On optimization of complete social networks ⋮ Flows in 3-edge-connected bidirected graphs ⋮ Recognizing hidden bicircular networks ⋮ On signed graphs with just two distinct Laplacian eigenvalues ⋮ Partially ordering the class of invertible trees ⋮ On products and line graphs of signed graphs, their eigenvalues and energy ⋮ Torsion formulas for signed graphs ⋮ Reconstructing ternary Dowling geometries ⋮ Signed graphs with stable maximum nullity at most two ⋮ An exact approach to the problem of extracting an embedded network matrix ⋮ Flow-contractible configurations and group connectivity of signed graphs ⋮ On perturbations of highly connected dyadic matroids ⋮ A Coxeter spectral classification of positive edge-bipartite graphs. I: Dynkin types \(\mathcal{B}_n\), \(\mathcal{C}_n\), \(\mathcal{F}_4\), \(\mathcal{G}_2\), \(\mathbb{E}_6\), \(\mathbb{E}_7\), \(\mathbb{E}_8\) ⋮ Signed bicyclic graphs minimizing the least Laplacian eigenvalue ⋮ Circular chromatic number of signed graphs ⋮ A group representation approach to balance of gain graphs ⋮ Signed posets ⋮ On Laplacian equienergetic signed graphs ⋮ Integer programming formulations and efficient local search for relaxed correlation clustering ⋮ Coalition formation games with separable preferences. ⋮ Conformal decomposition of integral flows on signed graphs with outer-edges ⋮ Biased graphs. I: Bias, balance, and gains ⋮ Biased graphs whose matroids are special binary matroids ⋮ Equivalent factor matroids of graphs ⋮ Subspace arrangements of type \(B_ n\) and \(D_ n\) ⋮ Complexity of planar signed graph homomorphisms to cycles ⋮ Homomorphisms of sparse signed graphs ⋮ Spectral aspects of symmetric matrix signings ⋮ Freeness of hyperplane arrangements between Boolean arrangements and Weyl arrangements of type \(B_{\ell}\) ⋮ On the representability of totally unimodular matrices on bidirected graphs ⋮ Colorations généralisées, graphes biorientés et deux ou trois choses sur François. (Generalized colourings, digraphs and some things concerning François) ⋮ Nowhere-zero integral flows on a bidirected graph ⋮ Quotient complexes and lexicographic shellability ⋮ Signed graphs with extremal least Laplacian eigenvalue ⋮ Signatures and signed switching classes

Cites Work

This page was built for publication: Signed graphs