Scribd Logo
Upload

Welcome to Scribd!

  • Graph Theory Using Maple

    Uploaded by

    ivanristic72
    32 views10 pages
    The document describes 7 graphs with varying properties: Graph 1 is an undirected unweighted graph with 5 vertices and 6 edges; Graph 2 is a directed unweighted graph with 5 vertices and 7 arcs; statements about the graphs being directed or undirected are provided; Graph 3 is an undirected unweighted graph with 10 vertices and 15 edges; Graph 4 is the same as Graph 3; Graph 5 is an undirected unweighted graph with 60 vertices and 90 edges; Graphs 6 and 7 are undirected weighted graphs with 6 vertices and different numbers of edges.

    Original Description:

    Graphs in Maple programming

    Original Title

    Graph_Theory_Using_Maple

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document describes 7 graphs with varying properties: Graph 1 is an undirected unweighted graph with 5 vertices and 6 edges; Graph 2 is a directed unweighted graph with 5 vertices and 7 arcs; statements about the graphs being directed or undirected are provided; Graph 3 is an undirected unweighted graph with 10 vertices and 15 edges; Graph 4 is the same as Graph 3; Graph 5 is an undirected unweighted graph with 60 vertices and 90 edges; Graphs 6 and 7 are undirected weighted graphs with 6 vertices and different numbers of edges.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    32 views10 pages

    Graph Theory Using Maple

    Uploaded by

    ivanristic72
    The document describes 7 graphs with varying properties: Graph 1 is an undirected unweighted graph with 5 vertices and 6 edges; Graph 2 is a directed unweighted graph with 5 vertices and 7 arcs; statements about the graphs being directed or undirected are provided; Graph 3 is an undirected unweighted graph with 10 vertices and 15 edges; Graph 4 is the same as Graph 3; Graph 5 is an undirected unweighted graph with 60 vertices and 90 edges; Graphs 6 and 7 are undirected weighted graphs with 6 vertices and different numbers of edges.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    of 10

    Graph 1: an undirected unweighted graph with 5 vertices and 6 edge(s) (1)

    Graph 2: a directed unweighted graph with 5 vertices and 7 arc(s) (2)

    false (3)

    true (4)

    (5)

    Graph 3: an undirected unweighted graph with 10 vertices and 15 edge(s) (6)

    false (7)

    true (8)
    (9)

    (10)

    120 (11)

    0 (12)

    Graph 4: an undirected unweighted graph with 10 vertices and 15 edge(s) (13)


    Graph 5: an undirected unweighted graph with 60 vertices and 90 edge(s) (14)
    Graph 6: an undirected weighted graph with 6 vertices and 9 edge(s)
    Graph 7: an undirected weighted graph with 6 vertices and 5 edge(s) (15)

    You might also like