Characterizations of signed graphs
From MaRDI portal
Publication:3924239
DOI10.1002/JGT.3190050409zbMATH Open0471.05035OpenAlexW1970729275MaRDI QIDQ3924239FDOQ3924239
Authors: Thomas Zaslavsky 
Publication date: 1981
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190050409
Directed graphs (digraphs), tournaments (05C20) Structural characterization of families of graphs (05C75)
Cites Work
Cited In (43)
- Signatures and signed switching classes
- On signed graphs with just two distinct adjacency eigenvalues
- The 9-connected excluded minors for the class of quasi-graphic matroids
- The graphs that have antivoltages using groups of small order
- Homomorphisms of signed graphs: an update
- A method of enumeration of negative cycles of a signed graph
- Six signed Petersen graphs, and their automorphisms
- List homomorphism problems for signed trees
- Biased graphs. I: Bias, balance, and gains
- Title not available (Why is that?)
- A note on counting flows in signed graphs
- Alpha-balanced graphs and matrices and GF(3)-representability of matroids
- Vertices of Localized Imbalance in a Biased Graph
- Negative circles in signed graphs: a problem collection
- Characterizations of line graphs in signed and gain graphs
- List homomorphisms to separable signed graphs
- Negative (and positive) circles in signed graphs: a problem collection
- Bipartite synchronization of coupled delayed neural networks with cooperative-competitive interaction via event-triggered control
- The minimal \(\mathbb{Z}_n\)-symmetric graphs that are not \(\mathbb{Z}_n\)-spherical
- The complexity of signed graph and edge-coloured graph homomorphisms
- Nowhere-zero flows on signed Eulerian graphs
- Aspects of topological approaches for data science
- On cospectrality of gain graphs
- Signed zero-divisor graphs over commutative rings
- The global invariant of signed graphic hyperplane arrangements
- Almost balanced biased graph representations of frame matroids
- A switching method for constructing cospectral gain graphs
- Switching pinning control for memristive neural networks system with Markovian switching topologies
- Graphical representations of graphic frame matroids
- Biased graphs whose matroids are special binary matroids
- The biased graphs whose matroids are binary
- The projective-planar signed graphs
- Complexity of planar signed graph homomorphisms to cycles
- Spectra of signed graphs and related oriented graphs
- A Dynamic Programming Algorithm To Test A Signed Graph For Balance
- Perfect matchings of regular bipartite graphs
- Signed graphs represented by \(D_{\infty}\)
- Total graph of a signed graph
- Bipartite synchronization for inertia memristor-based neural networks on coopetition networks
- On signed digraphs with all cycles negative
- An algorithmic characterization of splitting signed graph
- Cohomological Aspects of Hypergraphs
- Homomorphisms of signed graphs
This page was built for publication: Characterizations of signed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3924239)
