The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Signed graphs
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Biggs, N. (1974) · doi:10.1017/cbo9780511608704 · Cited by 2,940
Linear Inequalities and Related Systems.
Dantzig, G. B., Kuhn, H. W., & Tucker, A. W. (1956) · Medical Entomology and Zoology · Cited by 1,003
Symbolic psycho-logic: A model of attitudinal cognition
Abelson, R. P., & Rosenberg, M. J. (2007) · Behavioral Science · doi:10.1002/bs.3830030102 · Cited by 582
Structural Models: An Introduction to the Theory of Directed Graphs
Farbey, B. A., Harary, F., Norman, R. Z., & Cartwright, D. (1966) · OR · doi:10.2307/3007289 · Cited by 387
A Survey of Combinatorial Theory.
Barton, D. E., Srivastava, J. N., Harary, F., Rao, C. R., Rota, G. C., & Shrikhande, S. S. (1974) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2344967 · Cited by 172
Cited by
Consensus Problems on Networks With Antagonistic Interactions
Altafini, C. (2013) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2012.2224251 · Cited by 2,109
Computing global structural balance in large-scale signed social networks
Facchetti, G., Iacono, G., & Altafini, C. (2011) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1109521108 · Cited by 440
Valcher, M. E., & Misra, P. (2014) · Systems & Control Letters · doi:10.1016/j.sysconle.2014.01.006 · Cited by 415
Interval Bipartite Consensus of Networked Agents Associated With Signed Digraphs
Meng, D., Du, M., & Jia, Y. (2016) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2016.2528539 · Cited by 401
Novák, P., Ávila Robledillo, L., Koblížková, A., Vrbová, I., Neumann, P., & Macas, J. (2017) · Nucleic Acids Research · doi:10.1093/nar/gkx257 · Cited by 321
Metadata
- Authors
- Zaslavsky, T.
- Venue
- Discrete Applied Mathematics
- Publisher
- Elsevier BV
- Published
- 1982-01
- Volume
- 4
- Issue
- 1
- Pages
- 47-74
- ISSN
- 0166-218X (ISSN-L)
- OpenAlex
- W4210751359
- Cited by
- 548
- References
- 5
- FWCI
- 5.40
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Signed graphs. https://app.cochat.ai/papers/10.1016/0166-218x(82)90033-6
- The paper
- Zaslavsky, T. (1982). Signed graphs. Discrete Applied Mathematics. https://doi.org/10.1016/0166-218x(82)90033-6
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.