Graph Theory

Harary, F. (1969). Graph Theory. Addison-Wesley.

Type

Book

Intellectual base

Textbook

Year

1969

DOI

10.1201/9780429493768

ISBN

9780429493768

Link

https://doi.org/10.1201/9780429493768

Cited from

mathematics

Cited by

3 citations across 3 artifacts.

Each citation links to the sentence it supports in the citing article.

Primes

• Connectedness
  • In topology a space is connected when it has no partition into two disjoint nonempty open sets; in graph theory a graph is connected when every pair of vertices is joined by a path; and the connected components of any relational structure are its unique decomposition into maximal pieces within which every pair is mutually reachable.

    This sourceStandard reference defining graph connectedness, paths, connected components, cut edges (bridges), and articulation points.

Domain-specific

• Cubic Graph
  • The local constraint is simple, but it strongly organizes global possibilities: by the handshaking lemma, \(3|V|=2|E|\), so a finite cubic graph has an even number of vertices and exactly \(3|V|/2\) edges.
• Quotient Graph
  • Harary's classical graph-theory framework treats identification and contraction as fundamental graph operations.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:93c7010074db · see in the full table