Graph Theory

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

Type

Book

Intellectual base

Textbook

Year

1969

DOI

10.1201/9780429493768

ISBN

9780429493768

DOI registrant

Taylor & Francis (CRC Press)

Link

https://archive.org/details/graphtheory0000hara

Cited from

mathematics

Cited by

6 citations across 6 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.
• Diameter (graph theory)
  • The diameter of a connected graph is the greatest shortest-path distance between any two vertices.
• Graph Invariant
  • Listed in the references but not attached to a specific claim.
• Lattice graph
  • A lattice or grid graph is a graph induced by a regular lattice-like embedding, typically with vertices at grid sites and edges along prescribed neighboring directions.
• Quotient Graph
  • Harary's classical graph-theory framework treats identification and contraction as fundamental graph operations.

Verification

Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.

Does it back the claim? Not recorded. Neither this nor any other of the 6 citations of this work carries a recorded support check.

Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.

See how references were verified.

Links previously used in the corpus

Before the registry existed this work was also linked 1 other way.

• https://doi.org/10.1201/9780429493768 ×1

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