GRAPH-THEORETICAL PROPERTIES OF MAJOR SUBMATRICES,
Abstract
Major submatrices of an nxm (n < or = m) matrix of rank n have an important role in the theory of a linear graph. This paper presents the graph-theoretical relationships among the major submatrices. 'Adjacency' of two major submatrices is defined. Based on this new concept, a linear graph called a K-graph is defined, which represents the adjacencies among the major submatrices of a given matrix. The existence of a Hamilton circuit is shown in a K-graph. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Nov 01, 1966
- Accession Number
- AD0642503
Entities
People
- T. Kamae
Organizations
- University of Illinois Urbana–Champaign