Characterization of clusterability of signed graph in terms of Newcomb's balance of sentiments
From MaRDI portal
(Redirected from Publication:1855869)
Recommendations
Cited in
(15)- A computational technique in Coxeter spectral study of symmetrizable integer Cartan matrices
- Characterization of 2-path signed network
- 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
- An agent-based approach to stability of complete, directed, and signed social networks 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)
