Theory, Addison-Wesley, 1969, sections on distance, eccentricity, radius, and diameter

Frank Harary, G. (1969). Theory, Addison-Wesley, 1969, sections on distance, eccentricity, radius, and diameter. Addison-Wesley.

Type

Book

Intellectual base

Textbook

Year

1969

Link

no authoritative link yet

Cited by

2 citations across 2 artifacts.

Domain-specific

• Diameter (graph theory)
  • The diameter of a connected graph is the greatest shortest-path distance between any two vertices.
• 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.

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:6f1fb06981af · see in the full table