Scribd Logo
Upload

Welcome to Scribd!

  • 77 views

    Counting Sample Questions

    Uploaded by

    zesrab tanjeel khan
    The document contains 40 questions about graph theory concepts such as types of graphs (directed/undirected, bipartite), graph representations (adjacency matrix, adjacency list), graph properties (degree, connectivity), and algorithms on graphs (finding strongly connected components, isomorphism testing). The questions cover a wide range of graph theory topics testing understanding of fundamental concepts and ability to apply algorithms and reasoning to analyze graph properties and relations.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Counting Sample Questions

    Uploaded by

    zesrab tanjeel khan
    77 views13 pages
    The document contains 40 questions about graph theory concepts such as types of graphs (directed/undirected, bipartite), graph representations (adjacency matrix, adjacency list), graph properties (degree, connectivity), and algorithms on graphs (finding strongly connected components, isomorphism testing). The questions cover a wide range of graph theory topics testing understanding of fundamental concepts and ability to apply algorithms and reasoning to analyze graph properties and relations.

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document contains 40 questions about graph theory concepts such as types of graphs (directed/undirected, bipartite), graph representations (adjacency matrix, adjacency list), graph properties (degree, connectivity), and algorithms on graphs (finding strongly connected components, isomorphism testing). The questions cover a wide range of graph theory topics testing understanding of fundamental concepts and ability to apply algorithms and reasoning to analyze graph properties and relations.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    77 views13 pages

    Counting Sample Questions

    Uploaded by

    zesrab tanjeel khan
    The document contains 40 questions about graph theory concepts such as types of graphs (directed/undirected, bipartite), graph representations (adjacency matrix, adjacency list), graph properties (degree, connectivity), and algorithms on graphs (finding strongly connected components, isomorphism testing). The questions cover a wide range of graph theory topics testing understanding of fundamental concepts and ability to apply algorithms and reasoning to analyze graph properties and relations.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    You are on page 1of 13

    1) In a road network graph, vertices represent intersections and edges represent roads.

    If we want to model both one-way and two-way roads, what kind of graph that will
    be? Why?
    2) Suppose a graph has 11 vertices and 19 edges. Each of the odd-degree vertices has
    degree 3 and each of the even-degree vertices has degree 4. Find the numbers of
    the odd-degree and the even-degree vertices.
    3) Determine whether the following graph is a bipartite graph.

    4) Explain why the graph below is not a strongly connected graph. Also, explain why it
    is weakly connected. Determine the strongly connected components from the graph.

    5) Draw a directed weakly connected graph of your choice.

    6) The following matrix represents the adjacency matrix of a directed graph consisting
    of six vertices - a, b, c, d, e and f.
    Draw the graph from the adjacency matrix.

    7) Consider two complete graphs such that the number of vertices in the first graph is
    twice the number of vertices in the second graph. Moreover, the number of edges in
    the first graph is five times the number of edges in the second graph. Find the
    number of vertices and edges in both the graphs.
    8) You are given a graph G(V, E), where |V | = 12. Among the vertices of G, 9 of them
    have degree 3 each. If each of the remaining 3 vertices have the same degree (say,
    x), what condition must you put on the value of x?
    9) Find out whether the following graph is bipartite or not
    10)

    i) Find the adjacency list of the given graph.


    ii) Convert the graph into an undirected graph, and find the incidence matrix of the
    undirected graph.
    11) Find out the strongly connected components of the following graph:

    12) In a road network graph, vertices represent intersections and edges represent roads.
    If we want to model both one-way and two-way roads, and there is at most one road
    connecting two intersections, what kind of graph that will be? State your reasoning
    13) Suppose, you have been told to draw an undirected graph of 5 vertices with some
    constraints. The graph must contain at least one vertex of odd-degree, and at least
    one of even-degree. The odd-degree vertices must have degree 3, and the
    even-degree vertices must have degree 4. What are the possible number of edges of
    the graph?
    14) Find out if the graph in Figure 3 is bipartite or not, using two coloring algorithm. If
    bipartite, show the graph in bipartite form.

    15) Find the adjacency matrix of the graph


    16) Find out if Graph 1 and Graph 2 in Figure are isomorphic or not.

    17) Find out the strongly connected components of the graph

    18)
    19)

    20)
    21)

    22)

    23)
    24)

    25)

    25) What is the total number of vertices and edges in an undirected connected graph
    with a total degree of 40, 5 vertices of degree 4, 4 vertices of degree 3 and x vertices
    of degree 4?
    26)

    27)
    28)

    29) A simple graph with 6 vertices and 10 edges. One of its vertices has degree 4, two of
    them have degree 3 and two of them have degree 2. Is the above description valid?
    Give explanation for your answer.
    30)
    31)

    32)
    A simple graph with 6 vertices and 10 edges. One of its vertices has degree 4, two of
    them have degree 3 and two of them have degree 2. Is the above description valid?
    Give explanation for your answer.
    33)

    34)
    Construct a binary search tree for the following integers: -2, 10, -1, 15, -5, 9, -3, -6
    35)

    36)

    37)
    A wheel graph has 16 edges. How many vertices does the graph contain?
    38)

    39)

    40)

    You might also like