Characterization of clusterability of signed graph in terms of Newcomb's balance of sentiments

DOI10.1016/S0096-3003(01)00224-7zbMATH Open1023.05072MaRDI QIDQ1855869FDOQ1855869

Authors: Takehiro Inohara 

Publication date: 28 January 2003

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

Recommendations

• Signed graphs with negative self evaluation and clusterability of graphs
• Quasi-clusterability of signed graphs with negative self evaluation
• scientific article; zbMATH DE number 996908
• Characterization of 2-path signed network
• scientific article; zbMATH DE number 1264887

zbMATH Keywords

clusteringsocial psychology

Mathematics Subject Classification ID

Clustering in the social and behavioral sciences (91C20) Social networks; opinion dynamics (91D30) Signed and weighted graphs (05C22)

Cites Work

• On conditions for a meeting not to reach a deadlock
• n-person ‘soft’ games

Cited In (15)

• A computational technique in Coxeter spectral study of symmetrizable integer Cartan matrices
• Characterization of 2-path signed network
• An agent-based approach to stability of complete, directed, and signed social networks with loops
• A Gram classification of non-negative corank-two loop-free edge-bipartite graphs
• Symbolic computation of strong Gram congruences for Cox-regular positive edge-bipartite graphs with loops
• Signed graphs with negative self evaluation and clusterability of graphs
• Quasi-clusterability of signed graphs with negative self evaluation
• The domination numbers of cylindrical grid graphs
• A Gram classification of principal Cox-regular edge-bipartite graphs via inflation algorithm
• Clusterability of groups and information exchange in group decision making with approval voting system.
• 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\)
• Numeric and mesh algorithms for the Coxeter spectral study of positive edge-bipartite graphs and their isotropy groups
• A branch-and-cut algorithm for the maximum \(k\)-balanced subgraph of a signed graph
• Characterizing attitudinal network graphs through frustration cloud
• The necessary and sufficient condition for clustering of nodes based on the signs of connections in generalized signed networks

This page was built for publication: Characterization of clusterability of signed graph in terms of Newcomb's balance of sentiments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1855869)