How do I show that a simple graph of size n >= 2 always has at least two vertices of the same degree?

How do I show that a simple graph of size n >= 2 always has at least two vertices of the same degree?
by

1 Answer

Answer :

Here's one idea... just use counting:
by

Related questions

What is something you believe in but cannot prove?

Description : What is something you believe in but cannot prove?

Last Answer : I believe I can fly….okay maybe that’s after 27 cans of stella, but I can dream can’t I?

A certain tree has two vertices of degree 4, one vertex of degree 3 and one vertex of degree 2. If the other vertices have degree 1, how many vertices are there in the graph? (A) 5 (B) n – 3 (C) 20 (D) 11

Description : A certain tree has two vertices of degree 4, one vertex of degree 3 and one vertex of degree 2. If the other vertices have degree 1, how many vertices are there in the graph? (A) 5 (B) n – 3 (C) 20 (D) 11

Last Answer : (D) 11

How many edges must be removed to produce the spanning forest of a graph with N vertices, M edges and C connected components? (A) M+N-C (B) M-N-C (C) M-N+C (D) M+N+C

Description : How many edges must be removed to produce the spanning forest of a graph with N vertices, M edges and C connected components? (A) M+N-C (B) M-N-C (C) M-N+C (D) M+N+C

Last Answer : (C) M-N+C

Cyclometric complexity of a flow graph G with n vertices and e edges is (A) V(G) = e+n-2 (B) V(G) = e-n+2 (C) V(G) = e+n+2 (D) V(G) = e-n-2

Description : Cyclometric complexity of a flow graph G with n vertices and e edges is (A) V(G) = e+n-2 (B) V(G) = e-n+2 (C) V(G) = e+n+2 (D) V(G) = e-n-2

Last Answer : (B) V(G) = e-n+2

A graph is said to be ……………… if the vertices can be split into two sets V1 and V2 such there are no edges between two vertices of V1 or two vertices of V2. A) Partite B) Bipartite C) Rooted D) Bisects

Description : A graph is said to be ……………… if the vertices can be split into two sets V1 and V2 such there are no edges between two vertices of V1 or two vertices of V2. A) Partite B) Bipartite C) Rooted D) Bisects

Last Answer : B) Bipartite

what- A triangle is formed by the intersection of the lines y = 0, y = -3x + 3, and y = 3x + 3.Is the triangle equilateral, isosceles, or scalene Graph the lines on grid paper to find the vertices of the triangle?

Description : what- A triangle is formed by the intersection of the lines y = 0, y = -3x + 3, and y = 3x + 3.Is the triangle equilateral, isosceles, or scalene Graph the lines on grid paper to find the vertices of the triangle?

Last Answer : isosceles

what- A triangle is formed by the intersection of the lines y = 2x + 4, y = -x – 2, and x = 1.Is the triangle equilateral, isosceles, or scalene Graph the lines on grid paper to find the vertices of the triangle?

Description : what- A triangle is formed by the intersection of the lines y = 2x + 4, y = -x – 2, and x = 1.Is the triangle equilateral, isosceles, or scalene Graph the lines on grid paper to find the vertices of the triangle?

Last Answer : scalene

How can i use a graph to find the number of vertices in a octagonal pyramid?

Description : How can i use a graph to find the number of vertices in a octagonal pyramid?

Last Answer : The number of vertices in an octagonal pyramid is 9,irrespective of any graph.

For general graph, how one can get rid of repeated states? a) By maintaining a list of visited vertices b) By maintaining a list of traversed edges c) By maintaining a list of non-visited vertices d) By maintaining a list of non-traversed edges

Description : For general graph, how one can get rid of repeated states? a) By maintaining a list of visited vertices b) By maintaining a list of traversed edges c) By maintaining a list of non-visited vertices d) By maintaining a list of non-traversed edges

Last Answer : a) By maintaining a list of visited vertices

A graph is a collection of nodes, called ………. And line segments called arcs or ……….. that connect pair of nodes. A) vertices, edges B) edges, vertices C) vertices, paths D) graph node, edges

Description : A graph is a collection of nodes, called ………. And line segments called arcs or ……….. that connect pair of nodes. A) vertices, edges B) edges, vertices C) vertices, paths D) graph node, edges

Last Answer : A) vertices, edges

State True or False. i) An undirected graph which contains no cycles is called forest. ii) A graph is said to be complete if there is an edge between every pair of vertices. A) True, True B) False, True C) False, False D) True, False

Description : State True or False. i) An undirected graph which contains no cycles is called forest. ii) A graph is said to be complete if there is an edge between every pair of vertices. A) True, True B) False, True C) False, False D) True, False

Last Answer : A) True, True

State True of False. i) Network is a graph that has weights or costs associated with it. ii) An undirected graph which contains no cycles is called a forest. iii) A graph is said to be complete if there is no edge between every pair of vertices. A) True, False, True B) True, True, False C) True, True, True D) False, True, True

Description : State True of False. i) Network is a graph that has weights or costs associated with it. ii) An undirected graph which contains no cycles is called a forest. iii) A graph is said to be complete if there is no ... ) True, False, True B) True, True, False C) True, True, True D) False, True, True

Last Answer : B) True, True, False

A vertex cover of an undirected graph G(V, E) is a subset V1 ⊆ V vertices such that (A) Each pair of vertices in V1 is connected by an edge (B) If (u, v) ∈ E then u ∈ V1 and v ∈ V1 (C) If (u, v) ∈ E then u ∈ V1 or v ∈ V1 (D) All pairs of vertices in V1 are not connected by an edge

Description : A vertex cover of an undirected graph G(V, E) is a subset V1 ⊆ V vertices such that (A) Each pair of vertices in V1 is connected by an edge (B) If (u, v) ∈ E then u ∈ V1 and v ∈ V1 (C) If (u, v) ∈ E then u ∈ V1 or v ∈ V1 (D) All pairs of vertices in V1 are not connected by an edge

Last Answer : (C) If (u, v) ∈ E then u ∈ V1 or v ∈ V1

A ................. complete subgraph and a ................. subset of vertices of a graph G=(V,E) are a clique and a vertex cover respectively. (A) minimal, maximal (B) minimal, minimal (C) maximal, maximal (D) maximal, minimal

Description : A ................. complete subgraph and a ................. subset of vertices of a graph G=(V,E) are a clique and a vertex cover respectively. (A) minimal, maximal (B) minimal, minimal (C) maximal, maximal (D) maximal, minimal

Last Answer : (D) maximal, minimal 

acode is simply a subset of the vertices ofthe a. n bit b. ncube c. n single d. n double

Description : acode is simply a subset of the vertices ofthe a. n bit b. ncube c. n single d. n double

Last Answer : b. ncube

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 following trees are graceful?

Description : 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 following trees are ... (B) (b) and (c) (C) (a) and (c) (D) (a), (b) and (c)

Last Answer : Answer: D

A(5,0) and B(0,8) are two vertices of triangle OAB. a). What is the equation of the bisector of angle OAB. b). If E is the point of intersection of this bisector and the line through A and B,find the coordinates of E. Hence show that OA:OB = AE:EB -Maths 9th

Description : A(5,0) and B(0,8) are two vertices of triangle OAB. a). What is the equation of the bisector of angle OAB. b). If E is the point of intersection of this bisector and the line through A and B,find the coordinates of E. Hence show that OA:OB = AE:EB -Maths 9th

Last Answer : NEED ANSWER

A(5,0) and B(0,8) are two vertices of triangle OAB. a). What is the equation of the bisector of angle OAB. b). If E is the point of intersection of this bisector and the line through A and B,find the coordinates of E. Hence show that OA:OB = AE:EB -Maths 9th

Description : A(5,0) and B(0,8) are two vertices of triangle OAB. a). What is the equation of the bisector of angle OAB. b). If E is the point of intersection of this bisector and the line through A and B,find the coordinates of E. Hence show that OA:OB = AE:EB -Maths 9th

Last Answer : This answer was deleted by our moderators...

In ΔABC and ΔDEF, AB = DE, AB || DE, BC = EF and BC || EF. Vertices A, B and C are joined to vertices D, E and F respectively (see Fig. 8.22). Show that (i) quadrilateral ABED is a parallelogram (ii) quadrilateral BEFC is a parallelogram (iii) AD || CF and AD = CF (iv) quadrilateral ACFD is a parallelogram (v) AC = DF (vi) ΔABC ≅ ΔDEF. -Maths 9th

Description : In ΔABC and ΔDEF, AB = DE, AB || DE, BC = EF and BC || EF. Vertices A, B and C are joined to vertices D, E and F respectively (see Fig. 8.22). Show that (i) quadrilateral ABED is a parallelogram ( ... CF and AD = CF (iv) quadrilateral ACFD is a parallelogram (v) AC = DF (vi) ΔABC ≅ ΔDEF. -Maths 9th

Last Answer : . Solution: (i) AB = DE and AB || DE (Given) Two opposite sides of a quadrilateral are equal and parallel to each other. Thus, quadrilateral ABED is a parallelogram (ii) Again BC = EF and BC || EF ... (Given) BC = EF (Given) AC = DF (Opposite sides of a parallelogram) , ΔABC ≅ ΔDEF [SSS congruency]

ABCD is a parallelogram and AP and CQ are perpendiculars from vertices A and C on diagonal BD (see Fig. 8.21). Show that (i) ΔAPB ≅ ΔCQD (ii) AP = CQ -Maths 9th

Description : ABCD is a parallelogram and AP and CQ are perpendiculars from vertices A and C on diagonal BD (see Fig. 8.21). Show that (i) ΔAPB ≅ ΔCQD (ii) AP = CQ -Maths 9th

Last Answer : Q Solution: (i) In ΔAPB and ΔCQD, ∠ABP = ∠CDQ (Alternate interior angles) ∠APB = ∠CQD (= 90o as AP and CQ are perpendiculars) AB = CD (ABCD is a parallelogram) , ΔAPB ≅ ΔCQD [AAS congruency] (ii) As ΔAPB ≅ ΔCQD. , AP = CQ [CPCT]

A point O in the interior of a rectangle ABCD is joined with each of the vertices A, B, C and D. Then, show that OA^2 + OC^2 = OB^2 + OD^2. -Maths 9th

Description : A point O in the interior of a rectangle ABCD is joined with each of the vertices A, B, C and D. Then, show that OA^2 + OC^2 = OB^2 + OD^2. -Maths 9th

Last Answer : answer:

Without using Pythagoras’ theorem, show that the points A (0, 4), B(1, 2) and C(3, 3) are the vertices of a right angle triangle. -Maths 9th

Description : Without using Pythagoras’ theorem, show that the points A (0, 4), B(1, 2) and C(3, 3) are the vertices of a right angle triangle. -Maths 9th

Last Answer : Slope (m) = \(rac{(y_2-y_1)}{(x_2-x_1)}\) = \(rac{6-2}{5-1}\) = \(rac{4}{4}\) = 1Also slope (m) = tan θ, where θ is the inclination of the line to the positive direction of the x-axis in the anticlockwise direction. tan θ = 1 ⇒ θ = tan –11 = 45º.

Pick out the wrong statement. (A) Visible radiation provides the necessary activation energy in photochemical reactions (B) The order and molecularity of a complex reaction may not be the same (C) For a second order reaction, the slope of the graph/plot between rate and (concentration) is equal to the rate constant (k) (D) Molecularity of the reaction is always a whole number greater than zero

Description : Pick out the wrong statement. (A) Visible radiation provides the necessary activation energy in photochemical reactions (B) The order and molecularity of a complex reaction may not be the same (C) For ... rate constant (k) (D) Molecularity of the reaction is always a whole number greater than zero

Last Answer : (B) The order and molecularity of a complex reaction may not be the same

How to creat a simple x-y line graph using excel 2007?

Description : How to creat a simple x-y line graph using excel 2007?

Last Answer : i don't know a ton about 2007, but in 2003 (back when office seemed to work properly, for office), selecting the data to chart FIRST makes things a lot easier. if i recall from what i have used ... they put the chart types. run the wizard, and they might appear up there once the data is selected.

Which of the following connected simple graph has exactly one spanning tree? (A) Complete graph (B) Hamiltonian graph (C) Euler graph (D) None of the above

Description : Which of the following connected simple graph has exactly one spanning tree? (A) Complete graph (B) Hamiltonian graph (C) Euler graph (D) None of the above

Last Answer : (D) None of the above

A clique in a simple undirected graph is a complete subgraph that is not contained in any larger complete subgraph. How many cliques are there in the graph shown below? Image (A) 2 (B) 4 (C) 5 (D) 6

Description : A clique in a simple undirected graph is a complete subgraph that is not contained in any larger complete subgraph. How many cliques are there in the graph shown below?  (A) 2 (B) 4 (C) 5 (D) 6

Last Answer : (C) 5

Explain simple AGC and delayed AGC with the help of neat graph.

Description : Explain simple AGC and delayed AGC with the help of neat graph.

Last Answer : 1) Simple AGC:- Simple AGC is a system by means of which overall gain of a radio receiver is varied, automatically with the changing strength of the receiver signal to keep the ... not used in low cost radio receiver. It is used in high quality receiver like communication receiver.

The following graph represents the installed capacity for cement production (in tonnes) and the actual production (in tonnes) of nine cement plants of a cement company. Capacity utilization of a plant is defined as ratio of actual production of cement to installed capacity. A plant with installed capacity of at least 200 tonnes is called a large plant and a plant with lesser capacity is called a small plant. The difference between total production of large plants and small plants, in tonnes is _____

Description : The following graph represents the installed capacity for cement production (in tonnes) and the actual production (in tonnes) of nine cement plants of a cement company. Capacity utilization of a plant ... difference between total production of large plants and small plants, in tonnes is _____

Last Answer : Correct answer is 120.

In S-N diagram, the graph plotted between fatigue strength and number of stress cycles becomes horizontal for which type of materials? a. Ferrous materials b. Non-ferrous materials c. Both a. and b. d. None of the above

Description : In S-N diagram, the graph plotted between fatigue strength and number of stress cycles becomes horizontal for which type of materials? a. Ferrous materials b. Non-ferrous materials c. Both a. and b. d. None of the above

Last Answer : a. Ferrous materials

In the graph shown below, the region in which frequency ratio (ω/ω n ) > √2 is known as____ A. Amplification region B. Isolation region C. Spring controlled region D. None of the above

Description : In the graph shown below, the region in which frequency ratio (ω/ω n ) > √2 is known as____ A. Amplification region B. Isolation region C. Spring controlled region D. None of the above

Last Answer : B. Isolation region

Which one of the following is used to compute cyclomatic complexity ? (A) The number of regions – 1 (B) E – N + 1, where E is the number of flow graph edges and N is the number of flow graph nodes. (C) P – 1, where P is the number of predicate nodes in the flow graph G. (D) P + 1, where P is the number of predicate nodes in the flow graph G.

Description : Which one of the following is used to compute cyclomatic complexity ? (A) The number of regions - 1 (B) E - N + 1, where E is the number of flow graph edges and N is the number of flow graph nodes. (C) ... in the flow graph G. (D) P + 1, where P is the number of predicate nodes in the flow graph G.

Last Answer : (D) P + 1, where P is the number of predicate nodes in the flow graph G.

Consider a Hamiltonian Graph (G) with no loops and parallel edges. Which of the following is true with respect to this Graph (G) ? (a) deg(v) ≥ n/2 for each vertex of G (b) |E(G)| ≥ 1/2 (n-1)(n-2)+2 edges (c) deg(v) + deg(w) ≥ n for every v and w not connected by an edge (A) (a) and (b) (B) (b) and (c) (C) (a) and (c) (D) (a), (b) and (c)

Description : Consider a Hamiltonian Graph (G) with no loops and parallel edges. Which of the following is true with respect to this Graph (G) ? (a) deg(v) ≥ n/2 for each vertex of G (b) |E(G)| ≥ 1/2 (n-1)(n-2)+2 edges (c) deg(v) + deg( ... edge (A) (a) and (b) (B) (b) and (c) (C) (a) and (c) (D) (a), (b) and (c)

Last Answer : (D) (a), (b) and (c)

The graph of a linear equation in two variables always passes through three quadrants of the graph paper. True/false -Maths 9th

Description : The graph of a linear equation in two variables always passes through three quadrants of the graph paper. True/false -Maths 9th

Last Answer : answer:

The graph of a linear equation in two variables is always a straight line. True/false -Maths 9th

Description : The graph of a linear equation in two variables is always a straight line. True/false -Maths 9th

Last Answer : answer:

Can you show me an example of how a 10 dimensional graph could be useful?

Description : Can you show me an example of how a 10 dimensional graph could be useful?

Last Answer : These two are the most talented practitioners of information presentation that I know about : Edward Tufte David McCandless. I don’t think I’ve seen anything with 10 dimensions represented, but these two would be my guides if I needed to attempt it.

Can you show me an example of how a three or more dimensional graph would look like?

Description : Can you show me an example of how a three or more dimensional graph would look like?

Last Answer : answer:http://www.csupomona.edu/~jcclark/classes/bio542l/essays/graphtypes.html http://74.63.141.198/help/ccdsoft%20info/image_processing_features.htm scroll down to the bottom graphs.

The command used to give a heading to a graph is .... (a) plt.show() (b) plt.plot() (c) plt.xlabel() (d) plt.title() -Technology

Description : The command used to give a heading to a graph is .... (a) plt.show() (b) plt.plot() (c) plt.xlabel() (d) plt.title() -Technology

Last Answer : (d)plt.title()

What kind of graph is use to show discrete data?

Description : What kind of graph is use to show discrete data?

Last Answer : A bar graph shows discreet data, but other types can also.

What would a graph that has a negative slope show?

Description : What would a graph that has a negative slope show?

Last Answer : It would have a downhill slope from left to right

Why does a straight line on a graph show a constant rate of change?

Description : Why does a straight line on a graph show a constant rate of change?

Last Answer : What is the answer ?

Which type of graph would you use to show the number of students who went on the field trip and the number of students who did not go on the field trip in each class?

Description : Which type of graph would you use to show the number of students who went on the field trip and the number of students who did not go on the field trip in each class?

Last Answer : losers

The size of the graph matrix is A. Number of edges in the flow graph B. V Number of nodes in the flow graph C. Number of paths in the flow graph D. Number of independent paths.

Description : The size of the graph matrix is A. Number of edges in the flow graph B. V Number of nodes in the flow graph C. Number of paths in the flow graph D. Number of independent paths.

Last Answer : B. V Number of nodes in the flow graph

Point out the wrong statement. a) The Mapper outputs are sorted and then partitioned per Reducer b) The total number of partitions is the same as the number of reduce tasks for the job c) The intermediate, sorted outputs are always stored in a simple (key-len, key, value-len, value) format d) None of the mentioned

Description : Point out the wrong statement. a) The Mapper outputs are sorted and then partitioned per Reducer b) The total number of partitions is the same as the number of reduce tasks for the job c) The intermediate, ... always stored in a simple (key-len, key, value-len, value) format d) None of the mentioned

Last Answer : None of the mentioned

The area of a triangle is 5. Two of its vertices are (2, 1) and (3, –2). The third vertex is (x, y) -Maths 9th

Description : The area of a triangle is 5. Two of its vertices are (2, 1) and (3, –2). The third vertex is (x, y) -Maths 9th

Last Answer : Let A(x1, y1) = (3, 4), B(x2, y2) ≡ (0, 5), C(x3, y3) ≡ (2, -1)and D(x4, y4) ≡ (3, -2) be the vertices of quadrilateral ABCD.Area of quad. ABCD = \(rac{1}{2}\) |{(x1 y2 - x2 y1) + (x2y3 - x3y2) + (x3y4 - x4y3) ... ) + (12 + 6)}|= \(rac{1}{2}\) |{15 - 11 + 0 + 18}| = \(rac{1}{2}\)x 22 = 11 sq. units.

(0, –1) and (0, 3) are the two opposite vertices of a square. The other two vertices are: -Maths 9th

Description : (0, –1) and (0, 3) are the two opposite vertices of a square. The other two vertices are: -Maths 9th

Last Answer : (c) (15, 19)Let Δ(a, b) be the fourth vertex of the parallelogram ABCD. The diagonals of a parallelogram bisect each other at point O (say), so the diagonals AC and BD have the same mid-point.

If (0, 0) and (2, 0) are the two vertices of a triangle whose centroid is (1, 1), then the area of the triangle is: -Maths 9th

Description : If (0, 0) and (2, 0) are the two vertices of a triangle whose centroid is (1, 1), then the area of the triangle is: -Maths 9th

Last Answer : (b) \(\bigg(rac{2\sqrt{13}+20\sqrt2}{\sqrt{13}+\sqrt{17}+5\sqrt2},rac{8\sqrt{13}-6\sqrt{17}}{\sqrt{13}+\sqrt{17}+5\sqrt2}\bigg)\)Let A(x1, y1), B(x2, y2), C(x3, y3) be the vertices of ΔABC the ... +6)^2}\) = \(\sqrt{4+196}\) = \(\sqrt{200}=10\sqrt{2}\)∴ Co-ordinates of incentre of Δ ABC are

The two vertices of a triangle are (2, –1), (3, 2) and the third vertex lies on the line x + y = 5. The area of the triangle is 4 units. -Maths 9th

Description : The two vertices of a triangle are (2, –1), (3, 2) and the third vertex lies on the line x + y = 5. The area of the triangle is 4 units. -Maths 9th

Last Answer : (c) (5, 0) or (1, 4) Let the third vertex of the triangle be P(a, b). Since it lies on the line x + y = 5, a + b = 5 ...(i) Also, given area of triangle formed by the points (2, -1), (3, 2) and (a, b) = 4 ... b) - (-3a + b) = 5 + 15⇒ 4a = 20 ⇒ a = 5 ⇒ b = 0. ∴ The points are (1, 4) and (5, 0).

Write the coordinates of two points on X-axis and two points on Y-axis which are at equal distances from the origin. Connect all these points and make them as vertices of quadrilateral. Name the quadrilateral thus formed. -Maths 9th

Description : Write the coordinates of two points on X-axis and two points on Y-axis which are at equal distances from the origin. Connect all these points and make them as vertices of quadrilateral. Name the quadrilateral thus formed. -Maths 9th

Last Answer : Let a be the equal distance from origin on both axes. Now, the coordinates of two points on equal distance 'a'on x-axis are Pla, 0) and R(-a, 0). Also, the coordinates of two points on equal distance 'a' on Y-axis are Q(0, a) and S(0, -a). Join all the four points on the graph.