Algebraic connectivity of graphs
Open accessThe DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
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
Cites
Congruent Graphs and the Connectivity of Graphs
Whitney, H. (1932) · American Journal of Mathematics · doi:10.2307/2371086 · Cited by 863
Bounds for eigenvalues of doubly stochastic matrices
Fiedler, M. (1972) · Linear Algebra and its Applications · doi:10.1016/0024-3795(72)90011-0 · Cited by 41
Self-citation
Cited by
Items 101–121 of 121
Distributed Higher Order Consensus Protocols in Multiagent Dynamical Systems
Yu, W., Chen, G., Ren, W., Kurths, J., & Zheng, W. X. (2011) · IEEE Transactions on Circuits and Systems I: Regular Papers · doi:10.1109/tcsi.2011.2106032 · Cited by 291
Bipartite graph partitioning and data clustering
Zha, H., He, X., Ding, C., Simon, H., & Gu, M. (2001) · Proceedings of the tenth international conference on Information and knowledge management · doi:10.1145/502585.502591 · Cited by 291
Rendezvous of multiple mobile agents with preserved network connectivity
Su, H., Wang, X., & Chen, G. (2010) · Systems & Control Letters · doi:10.1016/j.sysconle.2010.03.006 · Cited by 284
Yu, W., Chen, G., & Cao, M. (2010) · Systems & Control Letters · doi:10.1016/j.sysconle.2010.06.014 · Cited by 284
Fault-Tolerant Consensus of Multi-Agent System With Distributed Adaptive Protocol
Chen, S., Ho, D. W. C., Li, L., & Liu, M. (2015) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2014.2366204 · Cited by 283
Delay robustness in consensus problems
Münz, U., Papachristodoulou, A., & Allgöwer, F. (2010) · Automatica · doi:10.1016/j.automatica.2010.04.008 · Cited by 272
Isoperimetric graph partitioning for image segmentation
Grady, L., & Schwartz, E. L. (2006) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2006.57 · Cited by 272
Natural Connectivity of Complex Networks
Jun, W., Barahona, M., Yue-Jin, T., & Hong-Zhong, D. (2010) · Chinese Physics Letters · doi:10.1088/0256-307x/27/7/078902 · Cited by 270
Linear and Nonlinear Projective Nonnegative Matrix Factorization
Yang, Z., & Oja, E. (2010) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2010.2041361 · Cited by 270
Assortativity in complex networks
Noldus, R., & Van Mieghem, P. (2015) · Journal of Complex Networks · doi:10.1093/comnet/cnv005 · Cited by 266
Lawler, G. F., & Sokal, A. D. (1988) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1988-0930082-9 · Cited by 265
Sensor Networks With Random Links: Topology Design for Distributed Consensus
Kar, S., & Moura, J. M. F. (2008) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2008.920143 · Cited by 261
Mesh parameterization: theory and practice
Hormann, K., Polthier, K., & Sheffer, A. (2008) · ACM SIGGRAPH ASIA 2008 courses · doi:10.1145/1508044.1508091 · Cited by 259
Landscapes and their correlation functions
Stadler, P. F. (1996) · Journal of Mathematical Chemistry · doi:10.1007/bf01165154 · Cited by 258
Criteria for global pinning-controllability of complex networks
Porfiri, M., & di Bernardo, M. (2008) · Automatica · doi:10.1016/j.automatica.2008.05.006 · Cited by 254
Spectral Measure of Structural Robustness in Complex Networks
Wu, J., Barahona, M., Tan, Y.-J., & Deng, H.-Z. (2011) · IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans · doi:10.1109/tsmca.2011.2116117 · Cited by 254
Differential Representations for Mesh Processing
Sorkine, O. (2006) · Computer Graphics Forum · doi:10.1111/j.1467-8659.2006.00999.x · Cited by 253
Alves Gomes, M., & Meisen, T. (2023) · Information Systems and e-Business Management · doi:10.1007/s10257-023-00640-4 · Cited by 165
Wang, Y., Di, Z., & Fan, Y. (2011) · PLoS ONE · doi:10.1371/annotation/1935b388-2831-4fb1-b8f2-914ab91c1ddc · Cited by 130
Murg, V., Verstraete, F., Schneider, R., Nagy, P. R., & Legeza, O. (2015) · Journal of Chemical Theory and Computation · doi:10.1021/ct501187j · Cited by 97
Bohland, J. W., Saperstein, S., Pereira, F., Rapin, J., & Grady, L. (2012) · Frontiers in Systems Neuroscience · doi:10.3389/fnsys.2012.00078 · Cited by 64
Metadata
- Authors
- Fiedler, M.
- Venue
- Czechoslovak Mathematical Journal
- Published
- 1973
- Volume
- 23
- Issue
- 2
- Pages
- 298-305
- ISSN
- 0011-4642 (ISSN-L)
- 1572-9141
- OpenAlex
- W1587744656
- Cited by
- 3,977
- References
- 2
- FWCI
- 0.00
- Type
- journal article
- Language
- en
- Open access
- green
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.