Pages that link to "Item:Q1855869"
From MaRDI portal
The following pages link to Characterization of clusterability of signed graph in terms of Newcomb's balance of sentiments (Q1855869):
Displayed 12 items.
- A Gram classification of non-negative corank-two loop-free edge-bipartite graphs (Q272348) (← links)
- The domination numbers of cylindrical grid graphs (Q627140) (← links)
- Signed graphs with negative self evaluation and clusterability of graphs (Q702554) (← links)
- A Gram classification of principal Cox-regular edge-bipartite graphs via inflation algorithm (Q1634759) (← links)
- 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\) (Q1790462) (← links)
- Clusterability of groups and information exchange in group decision making with approval voting system. (Q1856012) (← links)
- Quasi-clusterability of signed graphs with negative self evaluation (Q1888283) (← links)
- A computational technique in Coxeter spectral study of symmetrizable integer Cartan matrices (Q2282784) (← links)
- Numeric and mesh algorithms for the Coxeter spectral study of positive edge-bipartite graphs and their isotropy groups (Q2349672) (← links)
- A branch-and-cut algorithm for the maximum \(k\)-balanced subgraph of a signed graph (Q2414463) (← links)
- Symbolic computation of strong Gram congruences for Cox-regular positive edge-bipartite graphs with loops (Q2419038) (← links)
- An Agent-Based Approach to Stability of Complete, Directed, and Signed Social Networks with Loops (Q5049408) (← links)