Quasi-clusterability of signed graphs with negative self evaluation

DOI10.1016/J.AMC.2003.09.005MaRDI QIDQ1888283zbMATH OpenOpenAlexFDO

Authors Takehiro Inohara

Publication date 23 November 2004

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

Full work available at URL https://doi.org/10.1016/j.amc.2003.09.005

zbMATH Keywords

StabilitySigned graphsQuasi-clusterability

Mathematics Subject Classification ID

Signed and weighted graphs (05C22)

Recommendations

• Signed graphs with negative self evaluation and clusterability of graphs
• 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
• Negative (and positive) circles in signed graphs: a problem collection

Cites work

• scientific article; zbMATH DE number 49085 (Why is no real title available?)
• Characterization of clusterability of signed graph in terms of Newcomb's balance of sentiments
• Clusterability of groups and information exchange in group decision making with approval voting system.

Cited in

(3)

• Characterization of clusterability of signed graph in terms of Newcomb's balance of sentiments
• Signed graphs with negative self evaluation and clusterability of graphs
• An agent-based approach to stability of complete, directed, and signed social networks with loops

This page was built for publication: Quasi-clusterability of signed graphs with negative self evaluation

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