Scribd Logo
Upload

Welcome to Scribd!

  • 10 views

    55 63 PDF

    Uploaded by

    Mujahid128
    The document contains the adjacency matrices for 63 graphs. Each matrix contains 0s and 1s that define the connections between nodes in a graph. All matrices have 7 nodes and vary in their patterns of connections between nodes.

    Copyright:

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

    You might also like

    55 63 PDF

    Uploaded by

    Mujahid128
    10 views9 pages
    The document contains the adjacency matrices for 63 graphs. Each matrix contains 0s and 1s that define the connections between nodes in a graph. All matrices have 7 nodes and vary in their patterns of connections between nodes.

    Original Description:

    Original Title

    55-63.pdf

    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 contains the adjacency matrices for 63 graphs. Each matrix contains 0s and 1s that define the connections between nodes in a graph. All matrices have 7 nodes and vary in their patterns of connections between nodes.

    Copyright:

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

    55 63 PDF

    Uploaded by

    Mujahid128
    The document contains the adjacency matrices for 63 graphs. Each matrix contains 0s and 1s that define the connections between nodes in a graph. All matrices have 7 nodes and vary in their patterns of connections between nodes.

    Copyright:

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

    Graph 55

    0 1 1 1 0 0
     
    1 0 1 1 0 0
     1 0 1 1 0
    A  1 
    1 1 1 0 0 0
    0 0 1 0 0 1
     
    0 0 0 0 1 0
    Graph 56

    0 1 1 1 1 1
     
    1 0 1 1 1 0
     1 0 0 0 0
    A  1 
    1 1 0 0 0 0
    1 1 0 0 0 0
     
    1 0 0 0 0 0
    Graph 57

    1 0 1 1 1 0
     
    1 0 1 1 1 0
     1 0 0 0 0
    A  1 
    1 1 0 0 0 0
    1 1 0 0 0 1
     
    0 0 0 0 1 0
    Graph 58

    0 1 1 1 1 1
     
    1 0 0 1 0 1
     0 0 0 0 0
    A  1 
    1 1 0 0 0 0
    1 0 0 0 0 1
     
    1 1 0 0 1 0
    Graph 59

    0 1 0 1 1 1
     
    1 0 0 1 0 1
    0 0 0 0 0 1
    A 
    1 1 0 0 0 0
    1 0 0 0 0 1
     
    1 1 1 0 1 0
    Graph 60

    0 1 0 1 1 1
     
    1 0 0 1 0 1
    0 0 0 0 1 0
    A 
    1 1 0 0 0 0
    1 0 1 0 0 1
     
    1 1 0 0 1 0
    Graph 61

    0 0 1 0 0 1
     
    0 0 0 1 0 1
     0 0 0 0 1
    A  1 
    0 1 0 0 1 1
    0 0 0 1 0 1
     
    1 1 1 1 1 0
    Graph 62

    0 0 1 0 0 1
     
    0 0 0 1 1 1
     0 0 0 0 1
    A  1 
    0 1 0 0 1 0
    1 0 0 1 0 1
     
    1 1 1 0 1 0
    Graph 63

    0 1 0 0 1 1
     
    1 0 0 1 0 1
    0 0 0 0 0 1
    A 
    0 1 0 0 1 0
    1 0 0 1 0 1
     
    1 1 1 0 1 0

    You might also like