Semester : SEMESTER 5
Subject : Graph Theory and Combinatorics
Year : 2018
Term : DECEMBER
Branch : COMPUTER SCIENCE AND ENGINEERING
Scheme : 2015 Full Time
Course Code : CS 309
Page:4
20 9)
b)
௩5905 Pages: 4
following graph G.
Prove that if B is a circuit matrix of a connected graph G with ೮ edges andn (5)
vertices , then rank of B = e-n+1
How can two linear arrays be used to represent a digraph. Give an example. (5)
Compare this representation with edge list representation in terms of storage.
मैः بد kK के
Page ۰