Quasi-clusterability of signed graphs with negative self evaluation

DOI10.1016/j.amc.2003.09.005zbMath1055.05074OpenAlexW2055962911MaRDI QIDQ1888283

Takehiro Inohara

Publication date: 23 November 2004

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2003.09.005

zbMATH Keywords

StabilitySigned graphsQuasi-clusterability

Mathematics Subject Classification ID

Signed and weighted graphs (05C22)

Related Items (1)

An Agent-Based Approach to Stability of Complete, Directed, and Signed Social Networks with Loops

Cites Work

• Unnamed Item
• Characterization of clusterability of signed graph in terms of Newcomb's balance of sentiments
• Clusterability of groups and information exchange in group decision making with approval voting system.

This page was built for publication: Quasi-clusterability of signed graphs with negative self evaluation