Cites work
Cited in
(48)- Signatures and signed switching classes
- The biased graphs whose matroids are binary
- Signed graphs represented by \(D_{\infty}\)
- Alpha-balanced graphs and matrices and GF(3)-representability of matroids
- Negative (and positive) circles in signed graphs: a problem collection
- Biased graphs whose matroids are special binary matroids
- A method of enumeration of negative cycles of a signed graph
- List homomorphism problems for signed trees
- Characterizations of line graphs in signed and gain graphs
- Bipartite synchronization of coupled delayed neural networks with cooperative-competitive interaction via event-triggered control
- On cospectrality of gain graphs
- Aspects of topological approaches for data science
- Bipartite synchronization for inertia memristor-based neural networks on coopetition networks
- Homomorphisms of signed graphs: an update
- The minimal \(\mathbb{Z}_n\)-symmetric graphs that are not \(\mathbb{Z}_n\)-spherical
- The graphs that have antivoltages using groups of small order
- On signed graphs with just two distinct adjacency eigenvalues
- The global invariant of signed graphic hyperplane arrangements
- The projective-planar signed graphs
- The complexity of signed graph and edge-coloured graph homomorphisms
- Almost balanced biased graph representations of frame matroids
- Negative circles in signed graphs: a problem collection
- An algorithmic characterization of splitting signed graph
- A note on counting flows in signed graphs
- Vertices of Localized Imbalance in a Biased Graph
- Cohomological Aspects of Hypergraphs
- Six signed Petersen graphs, and their automorphisms
- A Dynamic Programming Algorithm To Test A Signed Graph For Balance
- Total graph of a signed graph
- scientific article; zbMATH DE number 7559391 (Why is no real title available?)
- The 9-connected excluded minors for the class of quasi-graphic matroids
- Homomorphisms of signed graphs
- Perfect matchings of regular bipartite graphs
- Nowhere-zero flows on signed Eulerian graphs
- On signed digraphs with all cycles negative
- Switching pinning control for memristive neural networks system with Markovian switching topologies
- List homomorphisms to separable signed graphs
- A switching method for constructing cospectral gain graphs
- Signed zero-divisor graphs over commutative rings
- Spectra of signed graphs and related oriented graphs
- Godsil-McKay switchings for gain graphs
- Gain total graphs and their spectra via G-phases and group representations
- A characterization of (K_n,U^-) in the class L(3)
- Vector valued switching in signed graphs
- The NEPS of gain graphs over arbitrary groups and its spectra
- Biased graphs. I: Bias, balance, and gains
- Complexity of planar signed graph homomorphisms to cycles
- Graphical representations of graphic frame matroids
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)
