Q. Consider the specification written below of a graph G

V(G ) = {1,2,3,4}

E(G ) = {(1,2), (1,3), (3,3), (3,4), (4,1)}

(i)        Draw the undirected graph.

(ii)       Also draw its adjacency matrix.                                           

 

Ans:

V(G) = {1,2,3,4}

E(G) = {(1,2),(1,3),(3,3,),(3,4),(4,1)}

(i). The undirected graph is shown as follows:-

 

 

 

 

(ii) The adjacency matrix is written as follows:-

 

 

Posted Date: 7/10/2012 6:08:55 AM | Location : United States

Ask an Expert

Related Discussions:- Undirected graph and adjacency matrix, Assignment Help, Ask Question on Undirected graph and adjacency matrix, Get Answer, Expert's Help, Undirected graph and adjacency matrix Discussions

Write discussion on Undirected graph and adjacency matrix
Your posts are moderated

Write your message here..

Related Questions

Need it urgently, Write an assembly program to separate the number of posit... Write an assembly program to separate the number of positive numbers and negative numbers from a given series of signed numbers.

Explain the bubble sort algorithm, Explain the bubble sort algorithm. ... Explain the bubble sort algorithm. Answer This algorithm is used for sorting a list. It makes use of a temporary variable for swapping. It compares two numbers at an insta

What is algorithm, What is Algorithm A finite sequence of steps for a... What is Algorithm A finite sequence of steps for accomplishing some computational task. An algorithm should Have steps which are simple and definite enough to be done

Addressing modes, Compare zero-address, one-address, two-address, and three... Compare zero-address, one-address, two-address, and three-address machines by writing programs to compute: Y = (A – B X C) / (D + E X F) for each of the four machines. The inst

Multidimensional array in one dimensional array, Q. By giving an example sh... Q. By giving an example show how multidimensional array can be represented in one the dimensional array.

Doubly linklist, explanation of doubly linklist explanation of doubly linklist

Binary search, An unsorted array is searched through linear search that sca... An unsorted array is searched through linear search that scans the array elements one by one until the wanted element is found. The cause for sorting an array is that we search

Breadth-first search, Breadth-first search starts at a given vertex h, whic... Breadth-first search starts at a given vertex h, which is at level 0. In the first stage, we go to all the vertices that are at the distance of one edge away. When we go there, we

Array implementation of a queue, Since the stack is list of elements, the q... Since the stack is list of elements, the queue is also a list of elements. The stack & the queue differ just in the position where the elements may be added or deleted. Similar to

Computational complexity, Generally, Computational complexity of algorithms... Generally, Computational complexity of algorithms are referred to through space complexity (space needed for running program) and time complexity (time needed for running the progr