GATE CSE
First time here? Checkout the FAQ!
x
+1 vote
23 views
Consider a Hamiltonian Graph G with no loops or parallel edges and with $|V(G)| = n ≥ 3$. Then which of the following is true ?

(1) $deg(v) ≥ \frac{n}{2}$ for each vertex v.

(2) $|E(G)| ≥ \frac{1}{2}(n – 1) (n – 2) + 2$

(3) $deg (v) + deg(w) ≥ n$ whenever v and w are not connected by an edge.

(4) All of the above
asked in Graph Theory by Loyal (3.2k points) 4 41
recategorized by | 23 views

Please log in or register to answer this question.



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
Top Users Oct 2017
  1. Arjun

    23338 Points

  2. Bikram

    17048 Points

  3. Habibkhan

    7912 Points

  4. srestha

    6238 Points

  5. Debashish Deka

    5438 Points

  6. jothee

    4968 Points

  7. Sachin Mittal 1

    4772 Points

  8. joshi_nitish

    4286 Points

  9. sushmita

    3964 Points

  10. Rishi yadav

    3794 Points


Recent Badges

Popular Question user1234
Copy Editor Ayush Upadhyaya
Popular Question asu
Popular Question .
Popular Question makhdoom ghaya
Popular Question junaid ahmad
Notable Question learner_geek
Notable Question jothee
Popular Question jothee
Notable Question Jeffrey Jose
27,290 questions
35,142 answers
83,926 comments
33,231 users