Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Narsingh deo
Winner
asked
in
Graph Theory
Mar 5, 2019
459
views
0
votes
0
votes
What is meant by edge disjoint hamiltonian circuits in a graph
graph-theory
Winner
asked
in
Graph Theory
Mar 5, 2019
by
Winner
459
views
answer
comment
Follow
share this
share
4 Comments
Show 5 previous comments
by
ankitgupta.1729
commented
Mar 5, 2019
reply
Follow
share this
haha bro why ?.. Aisa nhi bolte bhai :)
0
0
by
Winner
commented
Mar 5, 2019
reply
Follow
share this
Thanks,got it
1
1
by
prashant jha 1
commented
Mar 5, 2019
reply
Follow
share this
@ankitgupta.1729
arre bhai galat padhne ke liye :P
1
1
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
0
Answers
← Previous
Next →
← Previous in category
Next in category →
Related questions
0
votes
0
votes
0
answers
1
Ayush Upadhyaya
asked
in
Graph Theory
Jun 8, 2018
271
views
[4-14]Connectivity- Narsingh Deo
Show that a simple graph is nonseparable iff for any two given arbitrary edges a circuit can always be found that will include these two edges.
Ayush Upadhyaya
asked
in
Graph Theory
Jun 8, 2018
by
Ayush Upadhyaya
271
views
graph-theory
narsinghdeo
0
votes
0
votes
0
answers
2
Ayush Upadhyaya
asked
in
Graph Theory
Jun 8, 2018
353
views
[4-13]Connectivity-Narsingh Deo
Show that a graph G is non-separable iff every vertex pair can be placed in some circuit in G.
Ayush Upadhyaya
asked
in
Graph Theory
Jun 8, 2018
by
Ayush Upadhyaya
353
views
graph-theory
narsinghdeo
1
vote
1
vote
2
answers
3
Ayush Upadhyaya
asked
in
Graph Theory
Jun 2, 2018
1,175
views
Connectivity(4-20) Narsingh Deo
Is every regular graph of degree d(d$\geq$3) non-separable?If not, give a simple regular graph of degree 3 that is separable.
Ayush Upadhyaya
asked
in
Graph Theory
Jun 2, 2018
by
Ayush Upadhyaya
1.2k
views
graph-theory
deo
narsingh
0
votes
0
votes
0
answers
4
Ayush Upadhyaya
asked
in
Graph Theory
Jun 2, 2018
330
views
Connectivity(4-10)-Narsingh Deo
Prove that in a connected graph G a vertex v is a cut-vertex if and only if there exist two(or more) edges x and y incident on v such that no circuit in G includes both x and y.
Ayush Upadhyaya
asked
in
Graph Theory
Jun 2, 2018
by
Ayush Upadhyaya
330
views
graph-theory
narsingh
deo
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
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
From Rank 4200 to 64: My Journey to Success in GATE CSE Exam
What are the key things to focus on during the final 10-15 days before the GATE exam to improve performance?
All India GO Classes Mock test
NTA UGC NET JRF December 2022 Apply Online Form 2023
Life happens, just chill and do hardwork
Subjects
All categories
General Aptitude
(2.5k)
Engineering Mathematics
(9.3k)
Discrete Mathematics
(6.5k)
Mathematical Logic
(2.2k)
Set Theory & Algebra
(1.7k)
Combinatory
(1.5k)
Graph Theory
(992)
Probability
(1.2k)
Linear Algebra
(887)
Calculus
(712)
Digital Logic
(3.3k)
Programming and DS
(5.8k)
Algorithms
(4.6k)
Theory of Computation
(6.7k)
Compiler Design
(2.3k)
Operating System
(5.0k)
Databases
(4.6k)
CO and Architecture
(3.8k)
Computer Networks
(4.6k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(649)
Exam Queries
(842)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(853)
Recent Blog Comments
Eligibility Criteria: Discipline of...
4-year B.Tech./B.E. degree or a MSc./MCA degree...
I am not sure about others but I would pay 2X...
@DebRC Yes. This, time stamp and comparing...
Small feedback for next year. It would be great...
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy
