- Related Questions & Answers
- Representation of Graphs
- Basic Concepts of Graphs
- Representation of fractions
- Isomorphism and Homeomorphism of graphs
- Bipartite Graphs
- Eulerian Graphs
- Planar Graphs
- Hamiltonian Graphs
- Prim’s Algorithm (Simple Implementation for Adjacency Matrix Representation) in C++
- Representation of Relations using Graph
- Array Representation Of Binary Heap
- Strongly Connected Graphs
- Representation of class hierarchy in DBMS
- String representation of Boolean in Java
- Connected vs Disconnected Graphs

- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who

A graph can be represented using Adjacency Matrix way.

An Adjacency Matrix A[V][V] is a 2D array of size V × V where $V$ is the number of vertices in a undirected graph. If there is an edge between V_{x} to V_{y} then the value of A[V_{x}][V_{y}]=1 and A[V_{y}][V_{x}]=1, otherwise the value will be zero.

For a directed graph, if there is an edge between V_{x} to V_{y}, then the value of A[V_{x}][V_{y}]=1, otherwise the value will be zero.

**Adjacency Matrix of an Undirected Graph**

Let us consider the following undirected graph and construct the adjacency matrix −

Adjacency matrix of the above undirected graph will be −

a | b | c | d | |

a | 0 | 1 | 1 | 0 |

b | 1 | 0 | 1 | 0 |

c | 1 | 1 | 0 | 1 |

d | 0 | 0 | 1 | 0 |

**Adjacency Matrix of a Directed Graph**

Let us consider the following directed graph and construct its adjacency matrix −

Adjacency matrix of the above directed graph will be −

a | b | c | d | |

a | 0 | 1 | 1 | 0 |

b | 0 | 0 | 1 | 0 |

c | 0 | 0 | 0 | 1 |

d | 0 | 0 | 0 | 0 |

Advertisements