Register

#Graph Theory

158 views

1 Answer

1 votes
1 votes

https://mathworld.wolfram.com/EulerianGraph.html

  1. Euler showed (without proof) that a connected simple graph is Eulerian iff it has no graph vertices of odd degree (i.e., all vertices are of even degree). Euler showed (without proof) that a connected simple graph is Eulerian iff it has no graph vertices of odd degree (i.e., all vertices are of even degree). 
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
0 answers
1
Abhijeet_Kumar asked Dec 23, 2017
664 views
#GRAPH THEORY
User Avatar
1 votes
1 votes
2 answers
2
Harish Karnam asked Nov 21, 2017
664 views
#Graph theory #coloring
How to find number of ways for coloring a graph with 'm' colors for following graphs a)connected graph(with no cycles) b)regular graph
How to find number of ways for coloring a graph with 'm' colors for following graphsa)connected graph(with no cycles)b)regular graph
User Avatar
1 votes
1 votes
1 answer
3
suryansh rajput asked Oct 2, 2023
209 views
Graph Theory
User Avatar
3 votes
3 votes
0 answers
4
Kabir5454 asked Jan 2, 2023
457 views
graph theory
Let $G=(V,E)$ where $V=\left \{ 1,2,3,4,.....,150\right \}$ and $(u,v) \in E$ if either $(u mod v) =0$ or $(v mod u)=0$.The Chromatic number of G is ?
Let $G=(V,E)$ where $V=\left \{ 1,2,3,4,.....,150\right \}$ and $(u,v) \in E$ if either $(u mod v) =0$ or $(v mod u)=0$.The Chromatic number of G is ?
User Avatar
Link Copied!