Accession Number : AD0688834

Title :   A PROOF OF TUTTE'S REALIZABILITY CONDITION,

Corporate Author : ILLINOIS UNIV URBANA COORDINATED SCIENCE LAB

Personal Author(s) : Mayeda,Wataru

Report Date : MAY 1969

Pagination or Media Count : 23

Abstract : The paper gives a simple proof of the Tutte's realizability condition for a cut-set (circuit) matrix of a non-oriented graph. First, a minimum non-realizable matrix is defined as a matrix (N U) which satisfies (1) (N U) is not a cut-set (circuit) matrix, (2) (N U) does not satisfy the conditions in the Tutte's theorem, and (3) deleting any column other than that belongs to a unit matrix or any row of any normal form of (N U), the resultant matrix is realizable as a cut-set (circuit) matrix. A proof of the Tutte's theorem in this paper is accomplished by showing that minimum non-realizable matrices do not exist. (Author)

Descriptors :   (*GRAPHICS, THEOREMS), TOPOLOGY, MATRICES(MATHEMATICS), ELECTRICAL NETWORKS

Subject Categories : Electrical and Electronic Equipment
      Theoretical Mathematics

Distribution Statement : APPROVED FOR PUBLIC RELEASE