Estimating the number of weak balance structures in signed networks

DOI10.1016/j.cnsns.2018.02.034zbMath1470.05153OpenAlexW2793793412WikidataQ130190315 ScholiaQ130190315MaRDI QIDQ2207900

Yinghong Ma, Xiao Dong Zhang

Publication date: 23 October 2020

Published in: Communications in Nonlinear Science and Numerical Simulation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cnsns.2018.02.034

zbMATH Keywords

Diophantine equationsigned networkweak balance networks

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Related Items (1)

Social disruption games in signed networks

Cites Work

• A simple algorithm to detect balance in signed graphs
• On the notion of balance of a signed graph
• On an elementary proof of some asymptotic formulas in the theory of partitions
• Elementary Methods in Number Theory
• Unnamed Item
• Unnamed Item

This page was built for publication: Estimating the number of weak balance structures in signed networks