Scribd
Upload
311 views2 pages

Edge Edge Graph of The IEEE 39 Bus System

This document compares two ways of storing the IEEE 39 bus system in computers. Edge-edge graphs, and adjacency matrices that exploit matrix sparsity. Both methods are shown to require the same storage space.

Uploaded by

powereeuta
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
311 views2 pages

Edge Edge Graph of The IEEE 39 Bus System

This document compares two ways of storing the IEEE 39 bus system in computers. Edge-edge graphs, and adjacency matrices that exploit matrix sparsity. Both methods are shown to require the same storage space.

Uploaded by

powereeuta
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Author: Himanshu Jain

Institute: Virginia Tech

Comparing the Edge-Edge Graph of the IEEE 39 Bus System and its Sparse Adjacency Matrix
Key Terms
1. Edge-Edge Graph Graph that uses only the edges, and not any nodes, to store a network.
2. Feeder Path - The adjacent edge that is closer to a reference source and which provides the physical
path back to the reference source (Node 1 is the reference source in Fig. 1; for Graph Trace Analysis
[1] reference source is associated with a physical source of energy such as a substation in electric
circuits). Feeder path index is the number or index assigned to an edge that acts as the feeder path of
an edge or multiple edges. The edge number or index assigned to the reference source edge is -1.
3. Cotree Edge An edge in the complement of a graphs tree (which is called a cotree i.e. a set of all
the edges that are not part of the tree). Cotree edge can be identified in an edge-edge graph by the
indices of the two edges between which it is connected as shown in Fig. 1 and Table I.

Edge-Edge Graph of the IEEE 39 Bus System


Fig. 1 shows the tree and cotree edges of the IEEE 39 bus system [2], while Table I shows the feeder path
and cotree indices of its edge-edge graph. The sparse adjacency matrix of the IEEE 39 bus system is shown
in Table II. The topology of the IEEE 39 bus system can be recovered from the edge number, feeder path
index and cotree index columns of Table I. Node numbers are not needed. For example, rows 1 and 2
show that edges 1 and 39 are supplied by their feeder path which is edge -1 (reference source). Similarly,
edges 2, 3 and 40 in rows 3, 4 and 5 are supplied by their feeder path which is edge 1. Proceeding in this
manner the complete topology of the IEEE 39 bus system can be drawn.
Fig. 1: Tree and Cotree of the IEEE 39 Bus System

Tables I and II show that the space needed for storing the IEEE 39 bus system is the same (46X3 units of
storage) whether it is stored using the COO sparse matrix format, or using the edge-edge graph.

Author: Himanshu Jain

Institute: Virginia Tech

Table I: Edge-Edge Graph of the IEEE 39 Bus Network Topology


From
Node
1
1
2
2
2
3
3
4
4
5
5
6
6
6
7
10

To
Node
2
39
3
30
25
4
18
5
14
6
8
7
11
31
8
11

Edge
#
1
39
2
3
40
4
41
5
42
6
43
7
8
9
10
13

Feeder
Path
-1
-1
1
1
1
2
2
4
4
5
5
6
6
6
7
8

Cotree
Index
0
12
0
0
33
0
23
0
17
0
10
0
0
0
0
0

From
Node
8
9
10
10
12
13
12
14
15
16
16
16
16
17
17
19

To
Node
9
39
13
32
13
14
11
15
16
17
19
21
24
18
27
20

Edge
#
11
12
14
15
16
17
46
18
19
20
21
22
44
23
24
25

Feeder
Path
10
11
13
13
14
14
16
17
18
19
19
19
19
20
20
21

Cotree
Index
0
0
0
0
0
0
8
0
0
0
0
0
31
0
0
0

From
Node
19
21
26
20
22
22
23
23
25
25
26
26
28
29

To
Node
33
22
27
34
23
35
24
36
37
26
28
29
29
38

Edge
#
26
28
35
27
29
30
31
32
34
33
36
45
37
38

Feeder
Path
21
22
24
25
28
28
29
29
33
35
35
35
36
37

Cotree
Index
0
0
0
0
0
0
0
0
0
0
0
37
0
0

Table II: Sparse Adjacency Matrix of the IEEE 39 Bus Network Topology
(Only half the adjacency matrix needs to be stored due to symmetry)
Row Index
1
1
2
2
2
3
3
4
4
5
5
6
6
6
7
8

Column
Index
2
39
3
25
30
4
18
5
14
6
8
7
11
31
8
9

Value

Row Index

1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1

9
10
10
10
11
12
13
14
15
16
16
16
16
17
17
19

Column
Index
39
11
13
32
12
13
14
15
16
17
19
21
24
18
27
20

Value

Row Index

1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1

19
20
21
22
22
23
23
25
25
26
26
26
28
29

Column
Index
33
34
22
23
35
24
36
26
37
27
28
29
29
38

Value
1
1
1
1
1
1
1
1
1
1
1
1
1
1

References
[1]. L. Feinauer, K.J. Russell, R.P. Broadwater, Graph Trace Analysis and Generic Algorithms for
Interdependent Reconfigurable System Design and Control, in Naval Engineers Journal, vol. 120, no. 1,
pp. 29-40, May 2008.
[2]. IEEE 39 Bus System, Illinois Center for a Smarter Electric Grid (ICSEG). [Online]. Available:
http://publish.illinois.edu/smartergrid/ieee-39-bus-system/

You might also like