Abstract
AbstractWe present some preliminary concepts of graph theory with interesting and easy examples.
Highlights
N E ⊆ V⨯V p Order of the graph: m p Size of the graph: n
Significant theorems p The number of vertices of odd degree in a graph is always even
P An Euler walk is a walk that traverses every edges of a graph once n Criterion: During any walk in the graph, the number of times one enters a non-terminal vertex equals the number of times one leaves it
Summary
N E ⊆ V⨯V p Order of the graph: m p Size of the graph: n. P königsberg bridge on the Pregel River Find a traversal through the cities that would cross each bridge once and only once.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
