The DOI matches its Crossref record.
Introduction to Graph Theory
Abstract
Recall the definitions of graphs from Section 1.1.4. The degree of the vertex x was defined to be the number of edges that have x as an endpoint. We write degG(x) for the degree of x in graph G, or simply deg(x) if only one graph is being discussed. A graph is regular if all vertices have the same degree, and in particular a regular graph of degree 3 is called cubic. We denote the smallest of all degrees of vertices of G by δ(G), and the largest by ∆(G). The degree sequence of a graph consists of all the degrees of the vertices. For example, degree sequence (4, 2, 2, 1, 1, 0) corresponds to the graph
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
Cited by
Complex networks: structure and dynamics
BOCCALETTI, S., LATORA, V, MORENO, Y., CHAVEZ, M., & HWANG, D. (2006) · Physics Reports · doi:10.1016/j.physrep.2005.10.009 · Cited by 11,010
Watts, D. J. (2004) · Annual Review of Sociology · doi:10.1146/annurev.soc.30.020404.104342 · Cited by 1,163
From the phenomenology to the mechanisms of consciousness: integrated information theory 3.0
Oizumi, M., Albantakis, L., & Tononi, G. (2014) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1003588 · Cited by 1,128
Connected Components in Random Graphs with Given Expected Degree Sequences
Chung, F., & Lu, L. (2002) · Annals of Combinatorics · doi:10.1007/pl00012580 · Cited by 938
Multiparty entanglement in graph states
Hein, M., Eisert, J., & Briegel, H. J. (2004) · Physical Review A · doi:10.1103/physreva.69.062311 · Cited by 915
Metadata
- Venue
- Introduction to Combinatorics
- Publisher
- Chapman and Hall/CRC
- Published
- 2010-09-07
- Pages
- 159-174
- OpenAlex
- W1479863711
- Cited by
- 5,632
- References
- 0
- FWCI
- 778.91
- Type
- book chapter
- 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: Introduction to Graph Theory. https://app.cochat.ai/papers/10.1201/b12336-12
- The paper
- Introduction to Graph Theory. (2010). Introduction to Combinatorics. https://doi.org/10.1201/b12336-12
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.
