Our team

Wondering how this works?

Want to pass exams? or want to help students to pass?

Ask a Question

## Use me ?

### New updates

Searching for :working of siver silver electrodeDate:2017-08-22 21:34:14Done by:Anonymous user(Visitor)Searching for :working of siver silver electrodeDate:2017-08-22 21:33:29Done by:Anonymous user(Visitor)

Searching for :the water wraith was shriekingDate:2017-08-20 21:31:59Done by:Anonymous user(Visitor)

### Similar Questions

**UGC NET Computer Science Paper 2 5 A tree with n vertices is called graceful if its vertices can be labelled with integers 1 2 n such that the absolute value of the difference of the labels of adjacent vertices are all different Which of the**

1 Answer

**Let G be the non-planar graph with the minimum possible number of edges. Then G has -computer science-gate-2007**

1 Answer

**Let G be a complete undirected graph on 6 vertices. If vertices of G are labeled, then the number of distinct cycles of length 4 in G is equal to -gate-computer science-2012**

1 Answer

**Consider an undirected random graph of eight vertices. The probability that there is an edge between a pair of vertices is ½. What is the expected number of unordered cycles of length three? -gate-computer science-2012**

1 Answer

**Which of the following graphs has an Eulerian circuit? -computer science-gate-2007**

1 Answer

**Let G be a complete undirected graph on 6 vertices. If vertices of G are labeled, then the number of distinct cycles of length 4 in G is equal to -gate-cse-2012**

1 Answer

**Which of the following statements is/are TRUE for undirected graphs? -gate-computer science-2013**

1 Answer

**Show that the points (-2, 3), (8, 3) and (6, 7) are the vertices of a right triangle. Mathematics CBSE class 10 2013**

0 Answer

**If A (-4,8), B(-3,-4), C(0,-5) and D(5,6) are the vertices of a quadrilateral ABCD find its area. Mathematics CBSE class 10 2015**

0 Answer

**If P(-5,-3),Q(-4,-6),R(2,-3) and S(1,2) are the vertices of a quadrilateral PQRS, find its area. Mathematics CBSE class 10 2015**

0 Answer

**Let G be a simple undirected planar graph on 10 vertices with 15edges. If G is a connected graph, then the number of bounded faces in any embedding of G on the plane is equal to -gate-computer science-2012**

1 Answer

**If A(5,2), B(2,-2) and C (-2,t) are the vertices of a right angled triangle with angle B = 90 degree, then find the value of t. Mathematics CBSE class 10 2015**

1 Answer

**Let G be a complete undirected graph on 4 vertices, having 6 edges with weights being 1, 2, 3, 4, 5, and 6. The maximum possible weight that a minimum weight spanning tree of G can have is ____. Gate-cs-2016**

1 Answer

**UGC NET Computer Science Paper-2 December 2015 2. Which of the following statement(s) is/are false?**

1 Answer

**Consider the following rooted tree with the vertex labelled P as the root: (-Gate Computer Science 2014)**

1 Answer

**Prove that the area of a triangle with vertices (t, t −2), (t + 2, t + 2) and (t + 3, t) is independent of t. CBSE Mathematics**

1 Answer

**Prove that the points (3, 0), (6, 4) and (−1, 3) ar e the vertices of a right angled isosceles triangle. CBSE Mathematics**

1 Answer

**If A(1, 2), B( 4, 3) and C( 6, 6) are the three vertices of a parallelogram ABCD, find the coordinates of the fourth vertex D. CBSE Mathematics**

1 Answer

**Gate-cs-2016**

1 Answer

**Prove that the points (2, −2), (−2, 1) and (5, 2) a re the vertices of a right angled triangle. Also find the area of this triangle. CBSE Mathematics**

1 Answer

### Notes

**Design and Analysis of Algorithms Subject Code : 10CSL47 Lab Manual PROGRAM-11**

**CG and Visualisation Lab(10CSL67) Vtu prg-3**

**Design and Analysis of Algorithms Subject Code : 10CSL47 Lab Manual PROGRAM-7**

**Design and Analysis of Algorithms Subject Code : 10CSL47 Lab Manual PROGRAM-6**

**Design and Analysis of Algorithms Subject Code : 10CSL47 Lab Manual PROGRAM-3**

**CG and Visualisation Lab(10CSL67) Vtu prg-9**

**Data structure with C 10CS35 unit-5**

**Data structure with C 10CS35 unit-6**

**3 of Fire: Experiencing**

**S.Y.B.A. Political Science Paper - III - Public Administration (Mar) - Rev University of mumbai notes**

You are here:-->View note-->View question

## UGC NET Computer Science Paper 2 5 A tree with n vertices is called graceful if its vertices can be labelled with integers 1 2 n such that the absolute value of the difference of the labels of adjacent vertices are all different Which of the

(A) (a) and (b)(B) (b) and (c)

(C) (a) and (c)

(D) (a), (b) and (c)

By:scribed

Taged users:

Likes:

Be first to like this question

Dislikes:

Be first to dislike this question

Talk about thisDelete|Like|Dislike|

## Answers

Dscribed

Likes:

Be first to like this answer

Dislikes:

Be first to dislike this answer

Talk about thisOnce you have earned teacher badge you can edit this questionDelete|Like|Dislike|

------------------------------------

You dont have permission to add an answer herePlease see this