The Minimum Witt Index of a Graph
An independent set in a graph G is a set of pairwise nonadjacent vertices, and the maximum size, alpha(G), of an independent set in G is called the independence number. Given a graph G and weight matrix A of G with entries from some field F, the maximum dimension of an A-isotropic subspace, known as...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en en |
| Published: |
2007
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1974/682 |