Insights Blog
-- Browse All Articles --
Physics Articles
Physics Tutorials
Physics Guides
Physics FAQ
Math Articles
Math Tutorials
Math Guides
Math FAQ
Education Articles
Education Guides
Bio/Chem Articles
Technology Guides
Computer Science Tutorials
Forums
Intro Physics Homework Help
Advanced Physics Homework Help
Precalculus Homework Help
Calculus Homework Help
Bio/Chem Homework Help
Engineering Homework Help
Trending
Featured Threads
Log in
Register
What's new
Search
Search
Search titles only
By:
Intro Physics Homework Help
Advanced Physics Homework Help
Precalculus Homework Help
Calculus Homework Help
Bio/Chem Homework Help
Engineering Homework Help
Menu
Log in
Register
Navigation
More options
Contact us
Close Menu
JavaScript is disabled. For a better experience, please enable JavaScript in your browser before proceeding.
You are using an out of date browser. It may not display this or other websites correctly.
You should upgrade or use an
alternative browser
.
Forums
Homework Help
Precalculus Mathematics Homework Help
Proving a Cycle Exists in Finite Graphs with Degree 2+ Vertices
Reply to thread
Message
[QUOTE="TheMathNoob, post: 5344813, member: 569615"] [h2]Homework Statement [/h2] Exercise 0.1. Suppose that G is a finite graph all of whose vertices has degree two or greater. Prove that a cycle passes through each vertex. Conclude that G cannot be a tree. [h2]Homework Equations[/h2][h2]The Attempt at a Solution[/h2] If every vertex in a graph G has degree two or greater, then there is always a way to get in and out without using the same edge. If we start at any vertex and try to traverse the graph by using the rule of getting in and out and not using the same edge, eventually we will realize that we can't stop, so this implies that there is a cycle. Therefore G can't be a tree. I am new to this types of proofs, so I need feedback. [/QUOTE]
Insert quotes…
Post reply
Forums
Homework Help
Precalculus Mathematics Homework Help
Proving a Cycle Exists in Finite Graphs with Degree 2+ Vertices
Back
Top