Print Page | Close Window

Matrix Representation of graph Printed From: One Stop GATE Category: GATE Previous Years Test Papers - Discuss Here Forum Name: CS Papers Forum Discription: Computer Science Previous Year GATE Papers to can discussed here. URL: http://forum.onestopgate.com/forum_posts.asp?TID=1091 Printed Date: 07Feb2025 at 4:02am Topic: Matrix Representation of graph Posted By: sumana Subject: Matrix Representation of graph Date Posted: 08Apr2007 at 10:18pm 3.2 Matrix Representation of Graphs Although a pictorial representation of a graph is very convenient for a visual study, other representations are better for computer processing. A matrix is a convenient and useful way of representing a graph to a computer. Matrices lend themselves easily to mechanical manipulations. Besides, many known results of http://www.vyomworld.com/gate/cs/ada/3.2.asp# - (a) a b c d e f g h v1 0 0 0 1 0 1 0 0 v2 0 0 0 0 1 1 1 1 v3 0 0 0 0 0 0 0 1 v4 1 1 1 0 1 0 0 0 v5 0 0 1 1 0 0 1 0 v6 1 1 0 0 0 0 0 0 (b) Fig. 3-4 Graph and its incidence matrix. Such a matrix A is called the vertex-edge incidence matrix, or simply incidence matrix. Matrix A for a graph G is sometimes also written as A(G). A graph and its incidence matrix are shown in http://www.vyomworld.com/gate/cs/ada/3.2.asp# -

Print Page | Close Window