# A First Course in Graph Theory and CombinatoricsMatrices and Graphs

A First Course in Graph Theory and Combinatorics: Matrices and Graphs [Given a graph X, we associate two matrices to encode its information. The first is the adjacency matrixA or sometimes denoted AX or A(X). If n is the number of vertices of X, then A is an n × n matrix whose (i, j)-th entry is the number of edges between i and j. In case X is a simple graph, this is simply a (0, 1) matrix whose i, j-th entry is 1 or 0 according as i is joined to j.] http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png

# A First Course in Graph Theory and CombinatoricsMatrices and Graphs

Part of the Texts and Readings in Mathematics Book Series (volume 55)
Springer Journals — May 24, 2017
7 pages      /lp/springer-journals/a-first-course-in-graph-theory-and-combinatorics-matrices-and-graphs-l6BCz1jqD0
Publisher
Hindustan Book Agency
© Hindustan Book Agency (India) 2009
ISBN
978-81-85931-98-2
Pages
33 –40
DOI
10.1007/978-93-86279-39-2_4
Publisher site
See Chapter on Publisher Site

### Abstract

[Given a graph X, we associate two matrices to encode its information. The first is the adjacency matrixA or sometimes denoted AX or A(X). If n is the number of vertices of X, then A is an n × n matrix whose (i, j)-th entry is the number of edges between i and j. In case X is a simple graph, this is simply a (0, 1) matrix whose i, j-th entry is 1 or 0 according as i is joined to j.]

Published: May 24, 2017