Signed graphs with negative self evaluation and clusterability of graphs

DOI10.1016/j.amc.2003.09.015zbMath1054.05048OpenAlexW2033977338MaRDI QIDQ702554

Takehiro Inohara

Publication date: 17 January 2005

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.015

zbMATH Keywords

StabilityClusterabilitySigned graphs

Mathematics Subject Classification ID

Signed and weighted graphs (05C22)

Related Items (3)

An Agent-Based Approach to Stability of Complete, Directed, and Signed Social Networks with Loops ⋮ Relational dominant strategy equilibrium as a generalization of dominant strategy equilibrium in terms of a social psychological aspect of decision making ⋮ A matrix-based approach to searching colored paths in a weighted colored multidigraph

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: Signed graphs with negative self evaluation and clusterability of graphs