On the notion of balance of a signed graph
From MaRDI portal
Publication:2652071
DOI10.1307/MMJ/1028989917zbMATH Open0056.42103OpenAlexW1980769375WikidataQ131622383 ScholiaQ131622383MaRDI QIDQ2652071FDOQ2652071
Authors: Frank Harary
Publication date: 1954
Published in: Michigan Mathematical Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1307/mmj/1028989917
Cited In (only showing first 100 items - show all)
- More on spectral analysis of signed networks
- Bipartite consensus control of multiagent systems on coopetition networks
- Connected signed graphs of fixed order, size, and number of negative edges with maximal index
- Synchronizing Boolean networks asynchronously
- Homomorphisms of signed graphs: an update
- A method of enumeration of negative cycles of a signed graph
- Negative cycles in complete signed graphs
- Rectangular Matrices and Signed Graphs
- Chordally signed graphs
- Title not available (Why is that?)
- A class of generalized Tribonacci sequences applied to counting problems
- Partition signed social networks via clustering dynamics
- On the spectrum of the normalized Laplacian for signed graphs: interlacing, contraction, and replication
- Fast computing global structural balance in signed networks based on memetic algorithm
- Toward a Laplacian spectral determination of signed \(\infty\)-graphs
- Characterization of signed graphs whose iterated signed line graphs are balanced or \(S\)-consistent
- List homomorphisms to separable signed graphs
- Signed distance in signed graphs
- Degree correlations in signed social networks
- On the 4-color theorem for signed graphs
- Spectral characterizations of signed cycles
- Negative (and positive) circles in signed graphs: a problem collection
- On structures of bisubmodular polyhedra
- Curvature and higher order Buser inequalities for the graph connection Laplacian
- Edges and vertices in a unique signed circle in a signed graph
- On domination in signed 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)
- On signed degrees in signed graphs
- Attractor separation and signed cycles in asynchronous Boolean networks
- Social Balance and the Bernoulli Equation
- The line index and minimum cut of weighted graphs
- Rethinking structural balance in signed social networks
- A characterization of oriented hypergraphic balance via signed weak walks
- On dependent randomized rounding algorithms
- A balanced signed digraph
- Graph-balancing algorithms for average consensus over directed networks
- Determining the flow numbers of signed Eulerian graphs
- Complexity of planar signed graph homomorphisms to cycles
- On the structural balance dynamics under perceived sentiment
- Negation switching invariant 3-Path signed graphs
- Remarks on nowhere-zero flows in signed cubic graphs
- Measuring the balance of signed networks and its application to sign prediction
- Spectral aspects of symmetric matrix signings
- Switched signed graphs of integer additive set-valued signed graphs
- A note on the nullity of unicyclic signed graphs
- Some new results on colour-induced signed graphs
- On the achromatic number of signed graphs
- Signed spectral Turań-type theorems
- Critical groups of strongly regular graphs and their generalizations
- Balancing signed graphs
- Iterated local transitivity model for signed social networks
- Impossibility of deception in a conflict among subjects with interdependent preference
- Homomorphisms of signed graphs
- Enumeration of finite field labels on graphs
- Tutte's dichromate for signed graphs
- Maximum balanced subgraph problem parameterized above lower bound
- Signed graphs with extremal least Laplacian eigenvalue
- Edge perturbation on signed graphs with clusters: adjacency and Laplacian eigenvalues
- On signed graphs with just two distinct adjacency eigenvalues
- Balanced signed total graphs of commutative rings
- On the cut polytope
- Oriented hypergraphs: introduction and balance
- An algorithm for identifying Morishima and anti-Morishima matrices and balanced digraphs
- A simple algorithm to detect balance in signed graphs
- Strict 2-threshold graphs
- Six signed Petersen graphs, and their automorphisms
- Strong unimodularity for matrices and hypergraphs
- The number of homeomorphically irreducible trees, and other species
- Coloring signed graphs using DFS
- Biased graphs. I: Bias, balance, and gains
- An unconstrained quadratic binary programming approach to the vertex coloring problem
- Probabilistic GRASP-tabu search algorithms for the UBQP problem
- Bipartite consensus of multi-agent systems over signed graphs: state feedback and output feedback control approaches
- Balanced group-labeled graphs
- The odd-valued chromatic polynomial of a signed graph
- Parameterized algorithms for min-max 2-cluster editing
- Torsion formulas for signed graphs
- Applications of matrix morsifications to Coxeter spectral study of loop-free edge-bipartite graphs
- Signed \(k\)-uniform hypergraphs and tensors
- A characterization of signed hypergraphs and its applications to VLSI via minimization and logic synthesis
- Chromatic invariants of signed graphs
- The chromatic number of a signed graph
- Consistency in marked digraphs
- On the rank of weighted graphs
- The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds
- One-pass heuristics for large-scale unconstrained binary quadratic problems
- Bithreshold Graphs
- Dynamic graph models
- Free energy of \(\widehat{D_n}\) quiver Chern-Simons theories
- Identification of consistent functional genetic modules
- On maximal independent sets of vertices in claw-free graphs
- A faster parameterized algorithm for Group Feedback Edge Set
- The complexity of signed graph and edge-coloured graph homomorphisms
- A Gram classification of principal Cox-regular edge-bipartite graphs via inflation algorithm
- Nowhere-zero flows on signed Eulerian graphs
- Adaptive bipartite consensus on coopetition networks
- On eigenspaces of some compound signed graphs
- The number of nowhere-zero flows on graphs and signed graphs
- Balancedness and the least eigenvalue of Laplacian of signed graphs
- Consistency in the naturally vertex-signed line graph of a signed graph
This page was built for publication: On the notion of balance of a signed graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2652071)