Characterization of clusterability of signed graph in terms of Newcomb's balance of sentiments
From MaRDI portal
Publication:1855869
DOI10.1016/S0096-3003(01)00224-7zbMath1023.05072MaRDI QIDQ1855869
Publication date: 28 January 2003
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Clustering in the social and behavioral sciences (91C20) Social networks; opinion dynamics (91D30) Signed and weighted graphs (05C22)
Related Items (12)
A Gram classification of non-negative corank-two loop-free edge-bipartite graphs ⋮ An Agent-Based Approach to Stability of Complete, Directed, and Signed Social Networks with Loops ⋮ Quasi-clusterability of signed graphs with negative self evaluation ⋮ A Gram classification of principal Cox-regular edge-bipartite graphs via inflation algorithm ⋮ A branch-and-cut algorithm for the maximum \(k\)-balanced subgraph of a signed graph ⋮ Symbolic computation of strong Gram congruences for Cox-regular positive edge-bipartite graphs with loops ⋮ The domination numbers of cylindrical grid graphs ⋮ Signed graphs with negative self evaluation and clusterability of graphs ⋮ A computational technique in Coxeter spectral study of symmetrizable integer Cartan matrices ⋮ 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\) ⋮ Clusterability of groups and information exchange in group decision making with approval voting system. ⋮ Numeric and mesh algorithms for the Coxeter spectral study of positive edge-bipartite graphs and their isotropy groups
Cites Work
This page was built for publication: Characterization of clusterability of signed graph in terms of Newcomb's balance of sentiments
