Scribd Logo
Upload

Welcome to Scribd!

  • 7 views

    KN Patterns - Sage

    Uploaded by

    Akira Kobashi
    The document shows examples of using Sage to generate complete graphs (Kn) of different sizes and calculate the number of perfect matchings. It generates complete graphs of sizes 5, 6, and 7, prints the value of Euler's totient function divided by 2 for each size, which corresponds to the number of perfect matchings, and displays the graphs.

    Copyright:

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

    You might also like

    KN Patterns - Sage

    Uploaded by

    Akira Kobashi
    7 views3 pages
    The document shows examples of using Sage to generate complete graphs (Kn) of different sizes and calculate the number of perfect matchings. It generates complete graphs of sizes 5, 6, and 7, prints the value of Euler's totient function divided by 2 for each size, which corresponds to the number of perfect matchings, and displays the graphs.

    Original Description:

    Complete n-graph has phi(n)/2 patterns.

    Original Title

    Kn Patterns -- Sage

    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 shows examples of using Sage to generate complete graphs (Kn) of different sizes and calculate the number of perfect matchings. It generates complete graphs of sizes 5, 6, and 7, prints the value of Euler's totient function divided by 2 for each size, which corresponds to the number of perfect matchings, and displays the graphs.

    Copyright:

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

    KN Patterns - Sage

    Uploaded by

    Akira Kobashi
    The document shows examples of using Sage to generate complete graphs (Kn) of different sizes and calculate the number of perfect matchings. It generates complete graphs of sizes 5, 6, and 7, prints the value of Euler's totient function divided by 2 for each size, which corresponds to the number of perfect matchings, and displays the graphs.

    Copyright:

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

    5/3/2014

    Kn patterns -- Sage

    Knpatterns
    g = graphs.CompleteGraph(5)
    print euler_phi(5)/2
    g.show()
    2

    g = graphs.CompleteGraph(6)
    print euler_phi(6)/2
    g.show()
    1

    http://localhost:8080/home/admin/29/print

    1/3

    5/3/2014

    Kn patterns -- Sage

    g = graphs.CompleteGraph(7)
    print euler_phi(7)/2 # 3
    g.show()
    # 0,2,4,6,1,3,5,0
    # 0,1,2,3,4,5,6,0
    # 0,3,6,2,5,1,4,0
    3

    http://localhost:8080/home/admin/29/print

    2/3

    5/3/2014

    Kn patterns -- Sage

    http://localhost:8080/home/admin/29/print

    3/3

    You might also like