The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
An undirected graph has an even number of vertices of odd degree.
+2
votes
605
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?
graphtheory
asked
Oct 25, 2017
in
Mathematical Logic
by
hem chandra joshi
Active
(
4.1k
points)

605
views
answer
comment
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 .
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
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.
answered
Oct 25, 2017
by
AskHerOut
Junior
(
941
points)
comment
Please
log in
or
register
to add a comment.
← Prev. Qn. in Sub.
Next Qn. in Sub. →
← Prev.
Next →
Related questions
+1
vote
2
answers
1
An undirected graph G has n vertices and n1 edges then G is
An undirected graph G has n vertices and n1 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
by
shivani2010
Junior
(
545
points)

875
views
graphtheory
+2
votes
2
answers
2
An undirected graph is Eulerian if and only if all vertices of G are of the sum of the degrees of all nodes is
asked
Jun 12, 2016
in
Graph Theory
by
shivani2010
Junior
(
545
points)

1.1k
views
graphtheory
0
votes
0
answers
3
A graph $G$ is Eulerian path iff degree of each vertex is even with atmost one trivial component
asked
Dec 31, 2016
in
Graph Theory
by
Anand.
Active
(
2.3k
points)

128
views
graphtheory
engineeringmathematics
0
votes
0
answers
4
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?
asked
Oct 30, 2018
in
Probability
by
Mk Utkarsh
Boss
(
36.5k
points)

85
views
probability
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
Recent Posts
ISRO CSE 2020 PAPER ANALYSE
BARC OCES/DGFS 2020
ISI CMI PDF by GATE Overflow
Calculus Important Points
Management Trainee Recruitment COAL INDIA 2020
All categories
General Aptitude
1.9k
Engineering Mathematics
7.5k
Discrete Mathematics
5.2k
Mathematical Logic
2.1k
Set Theory & Algebra
1.4k
Combinatory
916
Graph Theory
824
Probability
1k
Linear Algebra
723
Calculus
592
Digital Logic
2.9k
Programming and DS
4.9k
Algorithms
4.4k
Theory of Computation
6.2k
Compiler Design
2.1k
Operating System
4.5k
Databases
4.1k
CO and Architecture
3.4k
Computer Networks
4.2k
Non GATE
1.4k
Others
1.4k
Admissions
595
Exam Queries
573
Tier 1 Placement Questions
23
Job Queries
72
Projects
18
Follow @csegate
Recent Blog Comments
@Abhisheksawarn608 what makes you think...
I am getting 151 marks excluding question not...
Thank you @Arjun sir :)
Thanks for that @rohit1001
@Dumbest Kid > Jocko Podcast
50,737
questions
57,297
answers
198,265
comments
104,978
users