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
- Signed degree sets in signed graphs
- On the symmetry of the Laplacian spectra of signed graphs
- Extremal spectral results related to spanning trees of signed complete graphs
- A quantum searching model finding one of the edges of a subgraph in a complete graph
- Eigenvalues and critical groups of Adinkras
- Gain distance matrices for complex unit gain graphs
- Embedding signed graphs in the line
- Social balance - a signed detour distance analysis
- Linear codes over signed graphs
- Algebraic topological characterizations of structural balance in signed graphs
- Burnside chromatic polynomials of group-invariant graphs
- List homomorphism problems for signed trees
- On eigenvector structure of weakly balanced networks
- Estimating the number of weak balance structures in signed networks
- Symbolic computation of strong Gram congruences for Cox-regular positive edge-bipartite graphs with loops
- A remark on eigen values of signed graph
- Edge coloring of the signed generalized Petersen graph
- On the number of balanced signed graphs
- Concepts of signed graph coloring
- Quantum search of matching on signed graphs
- Edge coloring signed graphs
- Totally frustrated states in the chromatic theory of gain graphs
- Characterizations of line graphs in signed and gain graphs
- Games on signed graphs
- The index of signed graphs with forbidden subgraphs
- A general model of binary opinions updating
- Graph modification for edge-coloured and signed graph homomorphism problems: parameterized and classical complexity
- On the multiplicity of \(\alpha\) as an \(A_\alpha(\varGamma)\)-eigenvalue of signed graphs with pendant vertices
- Bounding the largest eigenvalue of signed graphs
- Berge-acyclic multilinear 0-1 optimization problems
- Prescribed performance bipartite consensus for nonlinear agents with antagonistic interactions: a PI transformation approach
- Structure and stability of the equilibrium set in potential-driven flow networks
- The characteristic polynomial of a graph containing loops
- On the spectrum of some signed complete and complete bipartite graphs
- Generalized XOR non-locality games with graph description on a square lattice
- Approximation algorithms for balancing signed graphs
- A group representation approach to balance of gain graphs
- Signed complete graphs with maximum index
- Combinatorial characterization of the null spaces of symmetric H-matrices
- Title not available (Why is that?)
- 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
- The evolution of beliefs over signed social networks
- Signed graphs with strong anti-reciprocal eigenvalue property
- On Laplacian equienergetic signed graphs
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)