An application of graph theory to determinants
Date of Publication
1993
Document Type
Bachelor's Thesis
Degree Name
Bachelor of Science in Mathematics
College
College of Science
Department/Unit
Mathematics and Statistics
Abstract/Summary
This thesis presents how Coates and Konig digraphs were applied to determinants. Each of these digraphs can be used to represent an n x n matrix. The Coates digraph has n vertices corresponding to the number of rows (columns) of a matrix and the arcs drawn from vertex i to vertex j where the label of the arc is the entry aij of the matrix. The Konig digraph on the other hand has m + n vertices, m corresponds to the rows and n corresponds to the columns of the matrix. The row vertices are labelled from l to m and the column vertices, from l to n and are arranged in increasing order from top to bottom.Most of the theorems are about the properties of the determinants while the other theorems show the relationship or similarities of the two digraphs and its counterpart in the usual method of finding the determinants.
Abstract Format
html
Language
English
Format
Accession Number
TU06225
Shelf Location
Archives, The Learning Commons, 12F, Henry Sy Sr. Hall
Physical Description
75 leaves
Keywords
Graph theory; Determinants
Recommended Citation
Ong, E. P., & Jao, T. C. (1993). An application of graph theory to determinants. Retrieved from https://animorepository.dlsu.edu.ph/etd_bachelors/16127