Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Sign Up
Cited by 294

The DOI matches its Crossref record.

Introduction to Graph Theory

Grossman, Peter·1995·Discrete Mathematics for Computing
DOI 10.1007/978-1-349-13908-8_10
Open this paper in CoChat — free account

Abstract

The objects that we study in the branch of mathematics known as graph theory are not graphs drawn with x and y axes. In this chapter, the word ‘graph’ refers to a structure consisting of points (called ‘vertices’), some of which may be joined to other vertices by lines (called ‘edges’) to form a network. Structures of this type abound in computing. The computers on a site may be connected into a local area network, which in turn may be linked to national and international communications networks. The circuitry inside a computer (which we represented schematically by digital circuit diagrams in Chapter 8) is another example of a graph or network structure. At a more abstract level, we saw in Chapter 5 how a relation on a set can be depicted using a diagram that takes the form of a 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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1007/978-1-349-13908-8_10

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.

A few free checks a day · papers already verified open instantly · results are public

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

See all 294

Metadata

Authors
Grossman, P.
Venue
Discrete Mathematics for Computing
Publisher
Macmillan Education UK
Published
1995
Pages
170-196
DOI
10.1007/978-1-349-13908-8_10
OpenAlex
W2481508830
Cited by
294
References
0
FWCI
2.50
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.1007/978-1-349-13908-8_10
The paper
Grossman, P. (1995). Introduction to Graph Theory. Discrete Mathematics for Computing. https://doi.org/10.1007/978-1-349-13908-8_10

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.