The degree sequence of a simple graph is the sequence of the degrees of the nodes in the graph in

Gate Question Papers:

Gate Select Another Category Select Another Topic

Exam

Gate Question Topics

Category (172)

General Ability (20)

General Knowledge(5)

HR Interview (166)

Interview(7)

Logical Reasoning (36)

Numerical Ability (131)

Programming (13)

Verbal Ability (13)

Advertisements

Previous Question: What is the probability that divisor of 1099 is a multiple of 1096? Next Question: Suppose the predicate F(x, y, t) is used to represent the statement that person x can fool person y at time t. which one of the statements below expresses best the meaning of the formula "x y t(F (x, y, t))? option (A) Everyone can fool some person at some time (B) No one can fool everyone all the time (C) Everyone cannot fool some person all the time (D) No one can fool some person at some time

(#M40021707) GATE question MATHS Keep an EYE

The degree sequence of a simple graph is the sequence of the degrees of the
nodes in the graph in decreasing order. Which of the following sequences can not
be the degree sequence of any graph?: Asked In Gate MAN (10 years ago); Unsolved; Is this Puzzle helpful? (0) (0) Submit Your Solution

Dimple

India

Punjab

Time: 00:01:33

Points

Maths Quotes

As far as the laws of mathematics refer to reality, they are not certain; and as far as they are certain, they do not refer to reality.

Albert Einstein

It is a mathematical fact that the casting of this pebble from my hand alters the centre of gravity of the universe.

Thomas Carlyle

Placed User Comments

M4Math helped me a lot.

Vipul Chavan 3 years ago

Thanks m4 maths for helping to get placed in several companies.
I must recommend this website for placement preparations.

yash mittal 4 years ago

Latest Gate Aptitude Question SOLUTION: The degree sequence of a simple graph is the sequence of the degrees of the nodes in the graph in decreasing order. Which of the following sequences can not be the degree sequence