Signed graphs
From MaRDI portal
Cites work
- An interrelation between line graphs, eigenvalues, and matroids
- BICIRCULAR GEOMETRY AND THE LATTICE OF FORESTS OF A GRAPH
- Chromatic invariants of signed graphs
- Erratum to ``A class of geometric lattices based on finite groups
- Facing up to arrangements: face-count formulas for partitions of space by hyperplanes
- Generating all graph coverings by permutation voltage assignments
- scientific article; zbMATH DE number 3121294 (Why is no real title available?)
- scientific article; zbMATH DE number 3741421 (Why is no real title available?)
- scientific article; zbMATH DE number 3534506 (Why is no real title available?)
- scientific article; zbMATH DE number 3547309 (Why is no real title available?)
- scientific article; zbMATH DE number 3445271 (Why is no real title available?)
- scientific article; zbMATH DE number 3225111 (Why is no real title available?)
- scientific article; zbMATH DE number 3226832 (Why is no real title available?)
- scientific article; zbMATH DE number 3334022 (Why is no real title available?)
- scientific article; zbMATH DE number 3342868 (Why is no real title available?)
- scientific article; zbMATH DE number 3409373 (Why is no real title available?)
- scientific article; zbMATH DE number 3420754 (Why is no real title available?)
- On matroids on edge sets of graphs with connected subgraphs as circuits. II
- Orientation of signed graphs
- Regular 2-Graphs
- Signed graph coloring
- The Geometry of Root Systems and Signed Graphs
- Voltage graphs
Cited in
(only showing first 100 items - show all)- On the representability of totally unimodular matrices on bidirected graphs
- Nowhere-zero integral flows on a bidirected graph
- Signatures and signed switching classes
- Nowhere-zero integral chains and flows in bidirected graphs
- Dowling group geometries and the critical problem
- The biased graphs whose matroids are binary
- Subspaces with well-scaled frames
- Signed graph coloring
- 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
- Recognizing hidden bicircular networks
- 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)
- Biased graphs IV: Geometrical realizations
- Extracting pure network submatrices in linear programs using signed graphs.
- Signed graphs and the freeness of the Weyl subarrangements of type \(B_\ell\)
- 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
- Uniform convergence for signed networks under directed switching topologies
- Spectral characterizations of signed cycles
- A complexity dichotomy for signed \(\mathbf{H}\)-colouring
- Edges and vertices in a unique signed circle in a signed graph
- Short signed circuit covers of signed graphs
- On the achromatic number of signed graphs
- Finite-time and fixed-time bipartite consensus of multi-agent systems under a unified discontinuous control protocol
- Motions of grid-like reflection frameworks
- Iterated local transitivity model for signed social networks
- Falk invariants of signed graphic arrangements
- Reconstructing ternary Dowling geometries
- 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
- Signed posets
- Coalition formation games with separable preferences.
- Biased graphs whose matroids are special binary matroids
- Subspace arrangements of type \(B_ n\) and \(D_ n\)
- Quotient complexes and lexicographic shellability
- Combinatorial characterization of the null spaces of symmetric H-matrices
- A generalization of semimodular supersolvable lattice
- Non-broken circuits of reflection groups and factorization in \(D_ n\)
- A method of enumeration of negative cycles of a signed graph
- A note on the nullity of unicyclic signed graphs
- Which exterior powers are balanced?
- Zeta functions of edge-free quotients of graphs
- A colourful path to matrix-tree theorems
- Constructing signed strongly regular graphs via star complement technique
- A remark on eigen values of signed graph
- On optimization of complete social networks
- On signed graphs with just two distinct Laplacian eigenvalues
- Partially ordering the class of invertible trees
- Signed graphs with stable maximum nullity at most two
- Circular chromatic number of signed graphs
- A group representation approach to balance of gain graphs
- On Laplacian equienergetic signed graphs
- Integer programming formulations and efficient local search for relaxed correlation clustering
- Conformal decomposition of integral flows on signed graphs with outer-edges
- Evolution of social power over influence networks containing antagonistic interactions
- Costs and rewards in priced timed automata
- The circular chromatic numbers of signed series-parallel graphs
- Characterizing attitudinal network graphs through frustration cloud
- Spectral fundamentals and characterizations of signed directed graphs
- Density of \(C_{-4}\)-critical signed graphs
- Spectra of signed graphs
- Frustration-critical signed graphs
- Extremal spectral results related to spanning trees of signed complete graphs
- Eigenvalues and critical groups of Adinkras
- Flows of 3-edge-colorable cubic signed graphs
- List homomorphism problems for signed trees
- Some signed graphs whose eigenvalues are main
- Edge coloring of the signed generalized Petersen graph
- Unbalanced signed graphs with extremal spectral radius or index
- Graph modification for edge-coloured and signed graph homomorphism problems: parameterized and classical complexity
- The chromatic number of signed graphs with bounded maximum average degree
- On cospectrality of gain graphs
- On singular signed graphs with nullspace spanned by a full vector: signed nut graphs
- The odd-valued chromatic polynomial of a signed graph
- A note on shortest sign-circuit cover of signed 3-edge-colorable cubic graphs
- On relative clique number of triangle-free planar colored mixed graphs
- The number of switching isomorphism classes of signed graphs associated with particular graphs
- Relative clique number of planar signed graphs
- Binary signed-graphic matroids: representations and recognition algorithms
- Edge coloring of signed graphs
- Tutte's dichromate for signed graphs
- Restrained domination in signed graphs
- On the 4-color theorem for signed graphs
- Homomorphisms of signed graphs: an update
- Concepts of signed graph coloring
- Signed circuit cover of bridgeless signed graphs
- Two-connected signed graphs with maximum nullity at most two
- Bounds for the energy of a complex unit gain graph
- Gain-line graphs via \(G\)-phases and group representations
- Godsil-McKay switching for mixed and gain graphs over the circle group
- The main eigenvalues of signed graphs
- On the chromatic numbers of signed triangular and hexagonal grids
- Leader-following bipartite consensus with disturbance rejection for uncertain multiple Euler-Lagrange systems over signed networks
- Gain distance matrices for complex unit gain graphs
This page was built for publication: Signed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1160198)
