The DOI matches its Crossref record.
Congruent Graphs and the Connectivity of Graphs
Overview
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
Cited by
Algebraic connectivity of graphs
Fiedler, M. (1973) · Czechoslovak Mathematical Journal · doi:10.21136/cmj.1973.101168 · Cited by 3,977
Network structure and minimum degree
Seidman, S. B. (1983) · Social Networks · doi:10.1016/0378-8733(83)90028-x · Cited by 1,891
Vital nodes identification in complex networks
Lü, L., Chen, D., Ren, X.-L., Zhang, Q.-M., Zhang, Y.-C., & Zhou, T. (2016) · Physics Reports · doi:10.1016/j.physrep.2016.06.007 · Cited by 1,183
GPS-free positioning in mobile ad-hoc networks
Capkun, S., Hamdi, M., & Hubaux, J.-P. (2005) · Proceedings of the 34th Annual Hawaii International Conference on System Sciences · doi:10.1109/hicss.2001.927202 · Cited by 841
A survey for the quadratic assignment problem
Loiola, E. M., de Abreu, N. M. M., Boaventura-Netto, P. O., Hahn, P., & Querido, T. (2007) · European Journal of Operational Research · doi:10.1016/j.ejor.2005.09.032 · Cited by 741
Which graphs are determined by their spectrum?
van Dam, E. R., & Haemers, W. H. (2003) · Linear Algebra and its Applications · doi:10.1016/s0024-3795(03)00483-x · Cited by 654
Line graphs, link partitions, and overlapping communities
Evans, T. S., & Lambiotte, R. (2009) · Physical Review E · doi:10.1103/physreve.80.016105 · Cited by 615
GPS-free Positioning in Mobile Ad Hoc Networks
Čapkun, S., Hamdi, M., & Hubaux, J.-P. (2002) · Cluster Computing · doi:10.1023/a:1013933626682 · Cited by 510
Detection of functional modules from protein interaction networks
Pereira‐Leal, J. B., Enright, A. J., & Ouzounis, C. A. (2004) · Proteins: Structure, Function, and Bioinformatics · doi:10.1002/prot.10505 · Cited by 441
Maximum common subgraph isomorphism algorithms for the matching of chemical structures
Raymond, J. W., & Willett, P. (2002) · Journal of Computer-Aided Molecular Design · doi:10.1023/a:1021271615909 · Cited by 424
The structure and dynamics of networks with higher order interactions
Boccaletti, S., De Lellis, P., del Genio, C. I., Alfaro-Bittner, K., Criado, R., Jalan, S., & Romance, M. (2023) · Physics Reports · doi:10.1016/j.physrep.2023.04.002 · Cited by 364
RASCAL: Calculation of Graph Similarity using Maximum Common Edge Subgraphs
Raymond, J. W. (2002) · The Computer Journal · doi:10.1093/comjnl/45.6.631 · Cited by 319
Improving Graph Neural Network Expressivity via Subgraph Isomorphism Counting
Bouritsas, G., Frasca, F., Zafeiriou, S., & Bronstein, M. M. (2023) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2022.3154319 · Cited by 309
COSNET: Connecting Heterogeneous Social Networks with Local and Global Consistency
Zhang, Y., Tang, J., Yang, Z., Pei, J., & Yu, P. S. (2015) · Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/2783258.2783268 · Cited by 283
Efficient Heuristics for Maximum Common Substructure Search
Englert, P., & Kovács, P. (2015) · Journal of Chemical Information and Modeling · doi:10.1021/acs.jcim.5b00036 · Cited by 36
Metadata
- Authors
- Whitney, H.
- Venue
- American Journal of Mathematics
- Publisher
- JSTOR
- Published
- 1932-01
- Volume
- 54
- Issue
- 1
- Pages
- 150
- ISSN
- 0002-9327 (ISSN-L)
- OpenAlex
- W4231597948
- Cited by
- 863
- References
- 0
- FWCI
- 1.29
- Type
- journal article
- Language
- en
- Open access
- closed
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
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.