1. Let K n be the complete graph on n vertices and K m,n be the complete...
Question:
1. Let Kn be the complete graph on n vertices and Km,n be the complete bipartite graph on m and n vertices. Find the number of vertices of each graph.
|
|
2. Let Kn be the complete graph on n vertices and Km,n be the complete bipartite graph on m and n vertices. Find the number of edges of each graph.
|
|
3. A cycle is a closed path in which no vertex is repeated except the first and last. Using the graph G in Fig8-36(b), p.178, find the number of cycles through the vertex
|
|
4. A simple path from a vertex x to a vertex y is a path from x to y such that no vertex and hence no edge, is repeated. For the graph G in Fig 8-36(b), p.178, find the number of simple paths
|
|
5. A planar graph G = (V, E) has V = {1,2,3,4,5,6} and E = {{1,2},{1,3},{1,4},{1,5},{1,6},{2,3},{3,4},{4,5},{5,6},{6,2}}. Find
|
|
Income Tax Fundamentals 2013
ISBN: 9781285586618
31st Edition
Authors: Gerald E. Whittenburg, Martha Altus Buller, Steven L Gill