Dark Mode

Recent questions tagged degree-of-graph

13 votes

1 answer

1

GO Classes Test Series 2024 | Mock GATE | Test 14 | Question: 15
Let $\mathrm{G}$ be a simple undirected graph on 8 vertices such that there is a vertex of degree 1 , a vertex of degree 2 , a vertex of degree 3 , a vertex of degree 4, a vertex of degree 5 , a vertex of degree 6 and ... of degree 7. Which of the following can be the degree of the last vertex? (Select all that are possible) 0 3 4 8

GO Classes asked in Graph Theory Feb 5

565 views

5 votes

0 answers

2

TIFR CSE 2023 | Part B | Question: 10
A $d$-regular graph is one in which every vertex has degree $d$. Also, a minimum cut in a graph is a smallest set of edges which, upon removal, disconnects the graph, so that there are vertices in the resulting graph with no path between them. We are given two ... in $G_{2}$. Which of the following must be the size of this minimum cut? $0$ $1$ $2$ $3$ $4$

admin asked in Graph Theory Mar 14, 2023

by admin

579 views

0 votes

1 answer

3

Degree sequence of graph
Someone please solve it.

Overflow04 asked in Graph Theory Jun 29, 2022

632 views

1 vote

1 answer

4

NIELIT Scientific Assistant A 2020 November: 96
In an undirected graph, if we add the degrees of all vertices, it is: odd even cannot be determined always $n+1,$ where $n$ is number of nodes

gatecse asked in Graph Theory Dec 9, 2020

407 views

0 votes

1 answer

5

NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 7
The number of the edges in a regular graph of degree $’d’$ and $’n’$ vertices is Maximum of $n,d$ $n+d$ $nd$ $nd/2$

admin asked in Graph Theory Apr 1, 2020

by admin

566 views

0 votes

1 answer

6

NIELIT 2016 MAR Scientist B - Section B: 3
Maximum degree of any node in a simple graph with $n$ vertices is $n-1$ $n$ $n/2$ $n-2$

admin asked in Graph Theory Mar 31, 2020

by admin

657 views

0 votes

1 answer

7

NIELIT 2017 July Scientist B (IT) - Section B: 1
Given an undirected graph $G$ with $V$ vertices and $E$ edges, the sum of the degrees of all vertices is $E$ $2E$ $V$ $2V$

admin asked in Graph Theory Mar 30, 2020

by admin

9.9k views

0 votes

0 answers

8

NIELIT 2017 July Scientist B (CS) - Section B: 2
Which of the following statements is/are TRUE for an undirected graph? Number of odd degree vertices is even Sum of degrees of all vertices is even P only Q only Both P and Q Neither P nor Q

admin asked in Graph Theory Mar 30, 2020

by admin

1.2k views

0 votes

0 answers

9

Zeal Test Series 2019: Graph Theory - Degree Of Graph
A simple graph is one in which there are no self loops and each pair of distinct vertices is connected by at most one edge. Let G be a simple graph on 8 vertices such that there is a vertex of degree 1, a vertex of degree 2, a ... a vertex of degree 6 and a vertex of degree 7. Which of the following can be the degree of the last vertex ____ ?

Prince Sindhiya asked in Graph Theory Jan 2, 2019

by Prince Sindhiya

694 views

1 vote

1 answer

10

Graph Theory Doubt
If there are exactly 2 vertices x and y of odd degree in a graph G, then there must be a path between x and y, Is this true? Please explain with valid reasons.

Shamim Ahmed asked in Graph Theory Dec 21, 2018

by Shamim Ahmed

779 views

5 votes

1 answer

11

TIFR CSE 2019 | Part B | Question: 3
A graph is $d$ – regular if every vertex has degree $d$. For a $d$ – regular graph on $n$ vertices, which of the following must be TRUE? $d$ divides $n$ Both $d$ and $n$ are even Both $d$ and $n$ are odd At least one of $d$ and $n$ is odd At least one of $d$ and $n$ is even

Arjun asked in Graph Theory Dec 18, 2018

by Arjun

1.6k views

32 votes

3 answers

12

TIFR CSE 2018 | Part B | Question: 8
In an undirected graph $G$ with $n$ vertices, vertex $1$ has degree $1$, while each vertex $2,\ldots,n-1$ has degree $10$ and the degree of vertex $n$ is unknown, Which of the following statement must be TRUE on the graph $G$? There is a path ... Vertex $n$ has degree $1$. The diameter of the graph is at most $\frac{n}{10}$ All of the above choices must be TRUE

Arjun asked in Graph Theory Dec 10, 2017

by Arjun

5.4k views

2 votes

0 answers

13

Graph Degree sequence : Bondy and Murty : $1.1.16$
Let $d = (d_1,d_2,\dots, d_n)$ be a nonincreasing sequence of nonnegative integers, that is, $d_1 \geq d_2 \geq · · · \geq d_n \geq 0$. Show that: there is a loopless graph with degree sequence d if and only if $\sum_{i=1}^{n}d_i$ is even and $d_1 \leq \sum_{i=2}^{n}d_i$

dd asked in Graph Theory Jul 4, 2017

by dd

430 views

44 votes

9 answers

14

GATE CSE 2017 Set 2 | Question: 23
$G$ is an undirected graph with $n$ vertices and $25$ edges such that each vertex of $G$ has degree at least $3$. Then the maximum possible value of $n$ is _________ .

Madhav asked in Graph Theory Feb 14, 2017

by Madhav

17.3k views

15 votes

3 answers

15

GATE CSE 1987 | Question: 9c
Show that the number of odd-degree vertices in a finite graph is even.

makhdoom ghaya asked in Graph Theory Nov 14, 2016

by makhdoom ghaya

1.8k views

8 votes

1 answer

16

ISRO2009-52
If $\text{G}$ is a graph with e edges and n vertices the sum of the degrees of all vertices in $\text{G}$ is $e$ $e/2$ $e^2$ $2 e$

go_editor asked in Graph Theory Jun 15, 2016

2.8k views

16 votes

2 answers

17

CMI2015-A-05
An undirected graph has $10$ vertices labelled $1, 2,\dots , 10$ and $37$ edges. Vertices $1, 3, 5, 7, 9$ have degree $8$ and vertices $2, 4, 6, 8$ have degree $7.$ What is the degree of vertex $10$ ? $5$ $6$ $7$ $8$

go_editor asked in Graph Theory May 27, 2016

2.2k views

19 votes

6 answers

18

CMI2013-A-06
A simple graph is one in which there are no self-loops and each pair of distinct vertices is connected by at most one edge. Let $G$ be a simple graph on $8$ vertices such that there is a vertex of degree $1$, a vertex of degree $2$, a vertex of degree $3$, a vertex ... degree $6$ and a vertex of degree $7$. Which of the following can be the degree of the last vertex? $3$ $0$ $5$ $4$

go_editor asked in Graph Theory May 23, 2016

5.2k views

Page:

Recent questions tagged degree-of-graph