# Difference between revisions of "Math 622: Matrix Theory 2"

From MathWiki

(→Prerequisite) |
(→Minimal learning outcomes) |
||

Line 23: | Line 23: | ||

</div> | </div> | ||

+ | As a course directed toward research in combinatorial matrix theory, the emphasis in this course will be to develop some facility in a current research topic. Topics covered in past courses include the Colin de Verdiere parameter, the minimum rank problem for graphs, and Ramanujan graphs. | ||

+ | |||

=== Textbooks === | === Textbooks === | ||

## Revision as of 22:50, 30 October 2010

## Contents

## Catalog Information

### Title

Matrix Theory 2.

### Credit Hours

3

### Prerequisite

### Description

Research topics in combinatorial matrix theory.

## Desired Learning Outcomes

### Prerequisites

### Minimal learning outcomes

As a course directed toward research in combinatorial matrix theory, the emphasis in this course will be to develop some facility in a current research topic. Topics covered in past courses include the Colin de Verdiere parameter, the minimum rank problem for graphs, and Ramanujan graphs.

### Textbooks

Possible textbooks for this course include (but are not limited to):