Signed graphs with negative self evaluation and clusterability of graphs
From MaRDI portal
Recommendations
- Quasi-clusterability of signed graphs with negative self evaluation
- Characterization of clusterability of signed graph in terms of Newcomb's balance of sentiments
- scientific article; zbMATH DE number 3887734
- scientific article; zbMATH DE number 1264887
- On balanced signed graphs and consistent marked graphs
Cites work
Cited in
(8)- The necessary and sufficient condition for clustering of nodes based on the signs of connections in generalized signed networks
- 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
- Characterization of clusterability of signed graph in terms of Newcomb's balance of sentiments
- Characterization of 2-path signed network
- Social disruption games in signed networks
- Quasi-clusterability of signed graphs with negative self evaluation
- An agent-based approach to stability of complete, directed, and signed social networks with loops
This page was built for publication: Signed graphs with negative self evaluation and clusterability of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q702554)