PROPERTIES OF CLASSES OF PATHS.

Abstract

The properties of paths between a pair of vertices in a nonoriented linear graph have been discussed by several papers. This paper gives the properties of a class of paths where each class consists of all possible paths between a pair of vertices in a nonoriented, non-separable linear graph. It is clear that such properties should be known when one synthesizes a s.c. switching network which satisfies a set of given switching functions. An interesting application of classes of paths is to obtain all possible trees in a linear graph which was shown at the end of the paper. (Author)

Document Details

Document Type
Technical Report
Publication Date
May 01, 1964
Accession Number
AD0601155

Entities

People

  • W. Mayeda

Organizations

  • University of Illinois Urbana–Champaign

Tags

DTIC Thesaurus Topics

  • Switching

Fields of Study

  • Computer science
  • Mathematics

Readers

  • Graph Algorithms and Convex Optimization.