SOME PROPERTIES OF A EULER GRAPH,

Abstract

Some properties of a Euler graph are found. It is shown that the number of distinct circuits containing an edge in a Euler graph is odd, that the number of paths between any two vertices in a Euler graph is even and that the number of edges in a cut -set in a Euler graph is even. (Author)

Document Details

Document Type
Technical Report
Publication Date
Sep 01, 1969
Accession Number
AD0693793

Entities

People

  • S. Toida

Organizations

  • University of Illinois Urbana–Champaign

Tags

Readers

  • Graph Algorithms and Convex Optimization.