Facebook Page
Twitter
RSS
Results 1 to 5 of 5
  1. MHB Craftsman

    United States
    Status
    Offline
    Join Date
    Jul 2013
    Location
    Manteca, California
    Posts
    119
    Thanks
    78 times
    Thanked
    27 times
    #1
    Consider the complete graph with 5 vertices, denoted by K5.

    E.) Does K5 contain Hamiltonian circuits? If yes, draw them.

    I know that a Hamiltonian circuit is a graph cycle through a graph that visits each node exactly once. However, the trivial graph on a single node is considered to possess a Hamiltonian cycle, but the connected graph on two nodes is not. A graph possessing a Hamiltonian circuit is said to be a Hamiltonian graph.

    Is it correct that K5 doesn't contain Hamiltonian circuits because this is a connected graph on two nodes?

  2. MHB Apprentice

    Status
    Offline
    Join Date
    Feb 2012
    Posts
    36
    Thanks
    22 times
    Thanked
    7 times
    #2
    I have never done anything related with Graph Theory but with a google search for your problem I found this pdf, where it states that the number of Hamilton circuits in K(n) is
    (n-1)! [factorial]

    Hope the link will help you with the knowledge you have on graph theory!

    http://www.math.ku.edu/~jmartin/cour...ter6-part2.pdf

  3. Procurator
    Ackbach's Avatar
    United States
    Status
    Online
    Join Date
    Jan 2012
    Location
    TX, USA
    Posts
    2,090
    Thanks
    3980 times
    Thanked
    4625 times
    #3
    It does not have two nodes, but five nodes. Any complete graph with more than two vertices has a Hamiltonian cycle: just go around the graph in order.
    Mirabilis Max: Iam, tote mortuus..., cum tote mortuo, saepe tantum una res est quam agere potes.

    Inigo: Quid est illud?

    Mirabilis Max: Per vestes suas quaerere et nummos laxos circumspicere.

  4. MHB Craftsman

    United States
    Status
    Offline
    Join Date
    Jul 2013
    Location
    Manteca, California
    Posts
    119
    Thanks
    78 times
    Thanked
    27 times
    #4
    Consider the complete graph with 5 vertices, denoted by K5.

    Does K5 contain Hamiltonian circuits? If yes, draw them.

    Is it correct to say that K5 does contain Hamiltonian circuits because it has more than two vertices?

  5. Procurator
    Ackbach's Avatar
    United States
    Status
    Online
    Join Date
    Jan 2012
    Location
    TX, USA
    Posts
    2,090
    Thanks
    3980 times
    Thanked
    4625 times
    #5
    Quote Originally Posted by Joystar1977 View Post
    Is it correct to say that K5 does contain Hamiltonian circuits because it has more than two vertices?
    Well, having more than two vertices is not sufficient, by itself, to ensure that any particular graph contains a Hamiltonian circuit. It is necessary. However, because $K_{5}$, in addition to having more than two vertices, contains an edge from any vertex to any other vertex, it is quite straight-forward to construct a Hamiltonian circuit.
    Mirabilis Max: Iam, tote mortuus..., cum tote mortuo, saepe tantum una res est quam agere potes.

    Inigo: Quid est illud?

    Mirabilis Max: Per vestes suas quaerere et nummos laxos circumspicere.

Similar Threads

  1. Eulerian Circuits
    By Joystar1977 in forum Discrete Mathematics, Set Theory, and Logic
    Replies: 13
    Last Post: Aug-09, 20:12
  2. Euler circuits and mazes
    By Yuuki in forum Discrete Mathematics, Set Theory, and Logic
    Replies: 1
    Last Post: Jun-22, 21:30
  3. [SOLVED] Probability of current flowing through circuits
    By Jameson in forum Basic Probability and Statistics
    Replies: 6
    Last Post: Mar-19, 19:25
  4. Graph Theory. Decomposition of K_{2n+1} into hamiltonian cycles.
    By caffeinemachine in forum Discrete Mathematics, Set Theory, and Logic
    Replies: 2
    Last Post: Aug-25, 11:16

Posting Permissions

  • You may not post new threads
  • You may not post replies
  • You may not post attachments
  • You may not edit your posts
  •  
Math Help Boards