Introduction to graph theory

K. Fraughnaugh

Published 1973 in Mathematical Gazette

ABSTRACT

In graph theory, the term graph refers to a set of vertices and a set of edges. A vertex can be used to represent any object. Graphs may contain undirected or directed edges. An undirected edge is a set of two vertices. A directed edge is an ordered pair of two vertices where the edge goes from the first vertex to the second vertex. Graphs that contain directed edges are called directed graphs or digraphs.

PUBLICATION RECORD

  • Publication year

    1973

  • Venue

    Mathematical Gazette

  • Publication date

    1973-12-01

  • Fields of study

    Mathematics, Computer Science

  • Identifiers
  • External record

    Open on Semantic Scholar

  • Source metadata

    Semantic Scholar

CITATION MAP

EXTRACTION MAP

CLAIMS

  • No claims are published for this paper.

CONCEPTS

  • No concepts are published for this paper.

REFERENCES

  • No references are available for this paper.

Showing 0-0 of 0 references · Page 1 of 1

CITED BY

Showing 1-100 of 7057 citing papers · Page 1 of 71