menu
search
Log In
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

Subjects

Network Sites

 GO Mechanical
 GO Electrical
 GO Electronics
 GO Civil
 CSE Doubts

An undirected graph has an even number of vertices of odd degree.

2 votes
2k views
What does it means ?

An undirected graph has an even number of vertices of odd degree.

 

But let a 4 vertex cycle graph if it not complete having even vertex and even degree each vertex .Is it rt?
in Mathematical Logic 2k views
0
yes right.because you have 0 (even)number of vertices of odd degree.
0
I think here odd means different rather than does not divide by  2 .

1 Answer

1 vote
1) Vertices of even degree can be Even or Odd in number.

2) Vertices of odd degree have to be even in number.

So there is nothing wrong with a cyclic graph of 4 vertices.
← Prev. Next →
← Prev. Qn. in Sub. Next Qn. in Sub. →

Related questions

1 vote
2 answers
1
1.2k views
An undirected graph G has n vertices and n-1 edges then G is
An undirected graph G has n vertices and n-1 edges then G is A. Cyclic B. Addition of edge will make it cyclic C. Eulerian D. Is a Tree
An undirected graph G has n vertices and n-1 edges then G is A. Cyclic B. Addition of edge will make it cyclic C. Eulerian D. Is a Tree
asked Jun 12, 2016 in Graph Theory shivani2010 1.2k views
2 votes
2 answers
2
1.9k views
An undirected graph is Eulerian if and only if all vertices of G are of the sum of the degrees of all nodes is
An undirected graph is Eulerian if and only if all vertices of G are of the sum of the degrees of all nodes is A. Same degree B. ODD degree C. Need not be ODD D. is twice number of edges
asked Jun 12, 2016 in Graph Theory shivani2010 1.9k views
0 votes
0 answers
3
200 views
A graph $G$ is Eulerian path iff degree of each vertex is even with atmost one trivial component
For this proof ,proving $\Rightarrow$ If Graph $G$ is eulerian then degree of each vertex is even with atmost one trivial component. As $G$ is Eulerian ,it means it **must not** repeat Edges but can repeat vertices.Now for the Eulerian (path) traversal ,we pass through that ... $C,F =3$ contradictory.... help me out where i am wrong
asked Dec 31, 2016 in Graph Theory Anand. 200 views
0 votes
0 answers
4
405 views
Consider an undirected random graph of eight vertices.
Consider an undirected random graph of eight vertices. The probability that there is an edge between a pair of vertices is $\large \frac{1}{2}$. What is the probability that graph contains exactly 2 cycles of length 3?
Consider an undirected random graph of eight vertices. The probability that there is an edge between a pair of vertices is $\large \frac{1}{2}$. What is the probability that graph contains exactly 2 cycles of length 3?
asked Oct 30, 2018 in Probability Mk Utkarsh 405 views
Dark theme
Muffin by Hélio Chun
Thanks to Q2A
...