The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Explicit Concentrators from Generalized N-Gons
Abstract
Concentrators are graphs used in the construction of switching networks that exhibit high connectivity. A technique for establishing the concentration properties of a graph by analysis of its eigenvalues is given. If the ratio of the subdominant eigenvalue to the dominant eigenvalue is small, the graph is a good concentrator. Generalized N-gons are very sparse, locally tree-like graphs for which the eigenvalues can be calculated with relative ease. The eigenvalue ratios for the known N-gons are calculated and show that the N-gons are excellent concentrators.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Cited by
Eigenvalues, diameter, and mean distance in graphs
Mohar, B. (1991) · Graphs and Combinatorics · doi:10.1007/bf01789463 · Cited by 301
Metadata
- Authors
- Tanner, R. M.
- Venue
- SIAM Journal on Algebraic Discrete Methods
- Published
- 1984-09
- Volume
- 5
- Issue
- 3
- Pages
- 287-293
- ISSN
- 0196-5212 (ISSN-L)
- 2168-345X
- OpenAlex
- W2121284046
- Cited by
- 247
- References
- 1
- FWCI
- 4.41
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Explicit Concentrators from Generalized N-Gons. https://app.cochat.ai/papers/10.1137/0605030
- The paper
- Tanner, R. M. (1984). Explicit Concentrators from Generalized N-Gons. SIAM Journal on Algebraic Discrete Methods. https://doi.org/10.1137/0605030
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.
