# Matrices and Graphs

Research output: Working paperDiscussion paperOther research output

### Abstract

The present article is designed to be a contribution to the chapter `Combinatorial Matrix Theory and Graphs' of the Handbook of Linear Algebra, to be published by CRC Press. The format of the handbook is to give just definitions, theorems, and examples; no proofs. In the five sections given below, we present the most im- portant notions and facts about matrices related to (undirected) graphs. 1. Graphs. 2. The adjacency matrix and its eigenvalues. 3. Other matrix representations. 4. Graph parameters. 5. Association schemes.
Original language English Tilburg Operations research 20 2005-37 Published - 2005

### Publication series

Name CentER Discussion Paper 2005-37

### Fingerprint

Graph in graph theory
Association Scheme
Matrix Theory
Matrix Representation
Linear algebra
Undirected Graph
Eigenvalue
Theorem

• Graphs
• Matrices

### Cite this

Haemers, W. H. (2005). Matrices and Graphs. (CentER Discussion Paper; Vol. 2005-37). Tilburg: Operations research.
Haemers, W.H. / Matrices and Graphs. Tilburg : Operations research, 2005. (CentER Discussion Paper).
@techreport{94b6bd2871e741d3b978c73d4f076476,
title = "Matrices and Graphs",
abstract = "The present article is designed to be a contribution to the chapter `Combinatorial Matrix Theory and Graphs' of the Handbook of Linear Algebra, to be published by CRC Press. The format of the handbook is to give just definitions, theorems, and examples; no proofs. In the five sections given below, we present the most im- portant notions and facts about matrices related to (undirected) graphs. 1. Graphs. 2. The adjacency matrix and its eigenvalues. 3. Other matrix representations. 4. Graph parameters. 5. Association schemes.",
keywords = "Graphs, Matrices",
author = "W.H. Haemers",
note = "Pagination: 20",
year = "2005",
language = "English",
volume = "2005-37",
series = "CentER Discussion Paper",
publisher = "Operations research",
type = "WorkingPaper",
institution = "Operations research",

}

Haemers, WH 2005 'Matrices and Graphs' CentER Discussion Paper, vol. 2005-37, Operations research, Tilburg.
Tilburg : Operations research, 2005. (CentER Discussion Paper; Vol. 2005-37).

Research output: Working paperDiscussion paperOther research output

TY - UNPB

T1 - Matrices and Graphs

AU - Haemers, W.H.

N1 - Pagination: 20

PY - 2005

Y1 - 2005

N2 - The present article is designed to be a contribution to the chapter `Combinatorial Matrix Theory and Graphs' of the Handbook of Linear Algebra, to be published by CRC Press. The format of the handbook is to give just definitions, theorems, and examples; no proofs. In the five sections given below, we present the most im- portant notions and facts about matrices related to (undirected) graphs. 1. Graphs. 2. The adjacency matrix and its eigenvalues. 3. Other matrix representations. 4. Graph parameters. 5. Association schemes.

AB - The present article is designed to be a contribution to the chapter `Combinatorial Matrix Theory and Graphs' of the Handbook of Linear Algebra, to be published by CRC Press. The format of the handbook is to give just definitions, theorems, and examples; no proofs. In the five sections given below, we present the most im- portant notions and facts about matrices related to (undirected) graphs. 1. Graphs. 2. The adjacency matrix and its eigenvalues. 3. Other matrix representations. 4. Graph parameters. 5. Association schemes.

KW - Graphs

KW - Matrices

M3 - Discussion paper

VL - 2005-37

T3 - CentER Discussion Paper

BT - Matrices and Graphs

PB - Operations research

CY - Tilburg

ER -

Haemers WH. Matrices and Graphs. Tilburg: Operations research. 2005. (CentER Discussion Paper).