Results 1 to 3 of 3

Math Help - Simple Discrete Math Graphing Practice Problems & Euler circuit graph. Please help?

  1. #1
    Newbie
    Joined
    Mar 2014
    From
    United States
    Posts
    7

    Simple Discrete Math Graphing Practice Problems & Euler circuit graph. Please help?

    Link 1: http://i.imgur.com/bpRCfjq.jpg

    Link 2: Euler Circuit: http://i.imgur.com/PW7j5q3.jpg

    Okay the Euler circuit is pretty simple i think. I will update my answer later when i can upload it.

    Each vertex has an even degree. and there are multiple ways to draw the circuit. But as along as i used every edge at least once AND ONLY ONCE (even though i touched vertices MULTIPLE times) It is a Euler circuit.

    So is this correct? -
    Last edited by outkast32; April 9th 2014 at 02:53 PM.
    Follow Math Help Forum on Facebook and Google+

  2. #2
    MHF Contributor

    Joined
    Aug 2006
    Posts
    18,605
    Thanks
    1574
    Awards
    1

    Re: Simple Discrete Math Graphing Practice Problems & Euler circuit graph. Please hel

    Quote Originally Posted by outkast32 View Post
    For 1.a, that is just the number n points taken 2 at a time.
    For 1.b, each point in one cell is joined with each point in the other cell.

    In #3, there is an Euler Circuit provided the graph is connected and each vertex is of even degree.
    Follow Math Help Forum on Facebook and Google+

  3. #3
    Newbie
    Joined
    Mar 2014
    From
    United States
    Posts
    7

    Re: Simple Discrete Math Graphing Practice Problems & Euler circuit graph. Please hel

    Okay so for 1a. Am i getting this right? as a satisfactory answer:
    There are as many edges in K_n as there are subsets of both endpoints (2) that can be chosen from a set of n vertices. The number of ways to select 2 vertices from n vertices is n(n-1) / 2 aka n choose 2.
    Thus the # of edges in K_n is n(n-1)/2
    Is that how to "show" this?
    Then for 1b.
    the one part of graph has m vertices each with degree n an the other part has n vertices each with degree m..
    i see that m*n = e, if make my own little graph but i dont quite see how that comes from what i said above.
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Discrete Math Practice Problems (Please help confirm)
    Posted in the Discrete Math Forum
    Replies: 3
    Last Post: March 4th 2014, 06:48 PM
  2. discrete math relations simple problems help !!!!
    Posted in the Discrete Math Forum
    Replies: 3
    Last Post: December 2nd 2012, 08:25 AM
  3. Replies: 3
    Last Post: February 23rd 2011, 09:35 PM
  4. Euler path and Euler circuit problem
    Posted in the Discrete Math Forum
    Replies: 1
    Last Post: May 19th 2010, 08:18 PM
  5. Practice Problem (Intro to Discrete Math Class)
    Posted in the Discrete Math Forum
    Replies: 2
    Last Post: January 15th 2009, 09:38 AM

Search Tags


/mathhelpforum @mathhelpforum