A community for students.

Here's the question you clicked on:

55 members online
  • 0 replying
  • 0 viewing

dan815

  • one year ago

Prove that a graph where all the vertices have degree 5 cannot be composed into all isomorphic paths of length 6

  • This Question is Closed
  1. dan815
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    @hwyl

  2. dan815
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    @oldrin.bataku any ideas, my teacher said, try proof by contradiction

  3. hwyl
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    just for you, I will study mathematical proofs oh actually I just downloaded a book for that in my school's library want a copy ?

  4. dan815
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    this might be generalized to deg n and paths of n+1 length

  5. dan815
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    eh i just want this one question, u dont need much background, tell me if u want calrification on any definition

  6. hwyl
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    n0

  7. dan815
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    basically think of having a graph with all vertices with degree 5, how come such a graph can never be completely decomposed into all paths of length 6

  8. hwyl
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    I dont know how to do proofs

  9. dan815
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    |dw:1443674847336:dw|

  10. anonymous
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    Defs a question for oldrin

  11. imqwerty
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    ik isomorphic graphs :/ but i donno what isomorphic path is ..

  12. Not the answer you are looking for?
    Search for more explanations.

    • Attachments:

Ask your own question

Sign Up
Find more explanations on OpenStudy
Privacy Policy

Your question is ready. Sign up for free to start getting answers.

spraguer (Moderator)
5 → View Detailed Profile

is replying to Can someone tell me what button the professor is hitting...

23

  • Teamwork 19 Teammate
  • Problem Solving 19 Hero
  • You have blocked this person.
  • ✔ You're a fan Checking fan status...

Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy.

This is the testimonial you wrote.
You haven't written a testimonial for Owlfred.