adjacency matrix

adjacency matrix

Definition

Let

G

=

(

V

,

E

)

be a graph with

vertex set

V

=

{

v

1

,

…

,

v

n

}

and

edge set

E

. The

adjacency matrix

M

G

=

(

m

i

⁢

j

)

of

G

is defined as follows:

M

G

is an

n

×

n

matrix such that

m

i

⁢

j

=

{

1

if

{

v

i

,

v

j

}

∈

E

0

otherwise.

In other words, start with the

n

×

n

zero matrix

, put a

1

in

(

i

,

j

)

if there is an edge whose

endpoints

are

v

i

and

v

j

.

For example, the adjacency matrix of the following graph

is

(

0

0

1

1

0

0

0

0

1

1

1

0

0

0

1

1

1

0

0

0

0

1

1

0

0

)

.

Remarks

. Let

G

be a graph and

M

G

be its adjacency matrix.

•

M

G

is

symmetric

with

0

’s in its main diagonal.

•

The sum of the cells in any given column (or row) is the degree of the corresponding vertex. Therefore, the sum of all the cells in

M

G

is twice the number of edges in

G

.

•

M

G

=

𝟏

-

I

iff

G

is a

complete graph

. Here,

𝟏

is the matrix whose entries are all

1

and

I

is the

identity matrix

.

•

If we are given a

symmetric matrix

M

of order

n

whose entries are either

1

or

0

and whose entries in the main diagonal are all

0

, then we can

construct

a graph

G

such that

M

=

M

G

.

Generalizations

The above definition of an adjacency matrix can be extended to

multigraphs

(

multiple edges

between pairs of vertices allowed),

pseudographs

(loops allowed), and even directed pseudographs (edges are directional). There are two cases in which we can generalize the definition, depending on whether edges are directional.

1.

(Edges are not directional).

Since a multigraph is just a special case of a pseudograph, we will define

M

G

for a pseudograph

G

. Let

G

=

(

V

,

E

)

be a pseudograph with

V

=

{

v

1

,

…

,

v

n

}

The

adjacency matrix

M

G

=

(

m

i

⁢

j

)

of

G

is an

n

×

n

matrix such that

m

i

⁢

j

is the number of edges whose endpoints are

v

i

and

v

j

. Again,

M

G

is symmetric, but the main diagonal may contain non-zero entries, in case there are loops.

2.

(Edges are directional).

Since a

digraph

is a special case of a directed pseudograph, we again define

M

G

in the most general setting. Let

G

=

(

V

,

E

)

be a directed pseudograph with

V

=

{

v

1

,

…

,

v

n

}

and

E

⊆

V

×

V

×

(

ℕ

∪

{

0

}

)

. The

adjacency matrix

M

G

of

G

is an

n

×

n

matrix such that

m

i

⁢

j

=

|

{

k

∣

(

v

i

,

v

j

,

k

)

∈

E

}

|

.

In other words,

m

i

⁢

j

is the number of directed edges from

v

i

to

v

j

.

Remarks

•

If

G

is a multigraph, then the entries in the main diagonal of

M

G

must be all

0

.

•

If

G

is a graph, then

M

G

corresponds to the original definition given in the previous

section

.

•

If

G

is a digraph, then entries

M

G

consists of

0

’s and

1

’s and its main diagonal consists of all

0

’s.

•

Given

any

square matrix

M

, there is a directed pseudograph

G

with

M

=

M

G

. In

addition

,

M

corresponds to adjacency matrix of various types of graphs if appropriate conditions are imposed on

M

•

Generally, one can

derive

a pseudograph from a directed pseudograph by “forgetting” the order in the

ordered pairs

of vertices. If

G

is a directed pseudograph and

G

′

is the corresponding derived pseudograph. Let

M

G

=

(

m

i

⁢

j

)

and

M

G

′

=

(

n

i

⁢

j

)

, then

n

i

⁢

j

=

m

i

⁢

j

+

m

j

⁢

i

.

In the

language

of

category theory

, the above

operation

is done via a

forgetful functor

(from the

category

of directed pseudographs to the category of pseudographs). Other forgetful functors between categories of various types of graphs are possible. In each case, the forgetful functor has an associated operation on the adjacency matrices of the graphs involved.

Title

adjacency matrix

Canonical name

AdjacencyMatrix

Date of creation

2013-03-22 17:22:43

Last modified on

2013-03-22 17:22:43

Owner

CWoo (3771)

Last modified by

CWoo (3771)

Numerical id

7

Author

CWoo (3771)

Entry type

Definition

Classification

msc 05C50

Generated on Thu Feb 8 20:44:51 2018 by

LaTeXML