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

Graph & optimal scheduling, You are given an undirected graph G = (V, E) in... You are given an undirected graph G = (V, E) in which the edge weights are highly restricted. In particular, each edge has a positive integer weight of either {1,2,...,W}, where W

The smallest element of an array''s index, The smallest element of an array... The smallest element of an array's index is called its Lower bound.

Implementation of stack, Before programming a problem solution those employ... Before programming a problem solution those employees a stack, we have to decide how to represent a stack by using the data structures which exist in our programming language. Stac

Boundary tag system., boundary tag system in data structure? boundary tag system in data structure?

Data flow diagrams, How to construct a data flow diagram for a college assi... How to construct a data flow diagram for a college assignment and marking systemA

#title.structured programming, what do you understand by structured program... what do you understand by structured programming?explain with eg. top down and bottem up programming technique

Merging 4 sorted files containing 50, Merging 4 sorted files having 50, 10,... Merging 4 sorted files having 50, 10, 25 and 15 records will take time  O (100)

Array vs. ordinary variable, Q. Describe what do you understand by the term... Q. Describe what do you understand by the term array? How does an array vary from an ordinary variable? How are the arrays represented in the specific memory?

Sorting algorithm is best if the list is already sorted, Which sorting algo... Which sorting algorithm is best if the list is already sorted? Why? Insertion sort as there is no movement of data if the list is already sorted and complexity is of the order

B – trees, B-trees are special m-ary balanced trees utilized in databases s... B-trees are special m-ary balanced trees utilized in databases since their structure allows records to be added, deleted & retrieved with guaranteed worst case performance. A B-