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

Array implementation of lists, In the array implementation of the lists, we... In the array implementation of the lists, we will use the array to hold the entries and a separate counter to keep track of the number of positions are occupied. A structure will b

Enumerate about the concept of container, Enumerate about the concept of co... Enumerate about the concept of container A Container can have a size() operation. We can also ask (somewhat redundantly) whether a Container is empty. And even though a Contain

Compound interest, Write the algorithm for compound interest Write the algorithm for compound interest

Stack flowchart, example of stack using flowchart example of stack using flowchart

Storing a sparse matrix in memory, Explain an efficient method of storing a... Explain an efficient method of storing a sparse matrix in memory. Write a module to find the transpose of the sparse matrix stored in this way. A matrix which contains number o

Explain binary search tree, Binary search tree. A binary search tree is... Binary search tree. A binary search tree is a binary tree that is either empty or in which every node having a key that satisfies the following conditions: - All keys (if an

Data mining classification, do you have expert in data mining ? do you have expert in data mining ?

State about the pseudocode, State the Introduction to pseudocode No spe... State the Introduction to pseudocode No specific programming language is referred to; development of algorithms by using pseudocode uses generic descriptions of branching, loop

Execute algorithm to convert infix into post fix expression, Q. Execute you... Q. Execute your algorithm to convert the infix expression to the post fix expression with the given infix expression as input Q = [(A + B)/(C + D) ↑ (E / F)]+ (G + H)/ I

Entity relationship, what is cardinality what is cardinality