answer 1 and 2

SECTION 6.1 REVIEW TECHNIQUES Use graph terminology. W Prove or disprove that two graphs are isomorphic. Find a planar representation of a simple graph or prove that none exists. w Construct adjacency matrices and adjacency lists for graphs and directed graphs. MAIN IDEAS Diverse situations can be modeled by graphs. .Graphs can be represented in a computer by matri- ces or by linked lists. EXERCISES 6.1 1. Give the function g that is part of the formal definition of the directed graph shown. 2. Use the graph in the figure to answer the questions that follow. a. Is the graph simple? b. Is the graph complete? c. Is the graph connected? d. Can you find two paths from 3 to 6? e. Can you find a cycle? f. Can you find an arc whose removal will make the graph acyclic? g. Can you find an arc whose removal will make the graph not connected