Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged graph-coloring
1
votes
4
answers
31
NIELIT 2017 DEC Scientist B - Section B: 52
Let $G$ be a simple undirected graph on $n=3x$ vertices $(x \geq 1)$ with chromatic number $3$, then maximum number of edges in $G$ is $n(n-1)/2$ $n^{n-2}$ $nx$ $n$
Let $G$ be a simple undirected graph on $n=3x$ vertices $(x \geq 1)$ with chromatic number $3$, then maximum number of edges in $G$ is$n(n-1)/2$$n^{n-2}$$nx$$n$
admin
3.1k
views
admin
asked
Mar 30, 2020
Graph Theory
nielit2017dec-scientistb
discrete-mathematics
graph-theory
graph-coloring
+
–
0
votes
4
answers
32
UGC NET CSE | January 2017 | Part 2 | Question: 5
Consider a Hamiltonian Graph $G$ with no loops or parallel edges and with $\left | V\left ( G \right ) \right |= n\geq 3$. The which of the following is true? $\text{deg}\left ( v \right )\geq \frac{n}{2}$ for each vertex $v\\$ ... $v$ and $w$ are not connected by an edge All of the above
Consider a Hamiltonian Graph $G$ with no loops or parallel edges and with $\left | V\left ( G \right ) \right |= n\geq 3$. The which of the following is true?$\text{deg}\...
go_editor
2.1k
views
go_editor
asked
Mar 24, 2020
Graph Theory
ugcnetjan2017ii
graph-theory
graph-coloring
+
–
28
votes
6
answers
33
GATE CSE 2020 | Question: 52
Graph $G$ is obtained by adding vertex $s$ to $K_{3,4}$ and making $s$ adjacent to every vertex of $K_{3,4}$. The minimum number of colours required to edge-colour $G$ is _______
Graph $G$ is obtained by adding vertex $s$ to $K_{3,4}$ and making $s$ adjacent to every vertex of $K_{3,4}$. The minimum number of colours required to edge-colour $G$ is...
Arjun
13.7k
views
Arjun
asked
Feb 12, 2020
Graph Theory
gatecse-2020
numerical-answers
graph-theory
graph-coloring
2-marks
+
–
1
votes
3
answers
34
TIFR CSE 2020 | Part B | Question: 11
Which of the following graphs are bipartite? Only $(1)$ Only $(2)$ Only $(2)$ and $(3)$ None of $(1),(2),(3)$ All of $(1),(2),(3)$
Which of the following graphs are bipartite?Only $(1)$Only $(2)$Only $(2)$ and $(3)$None of $(1),(2),(3)$All of $(1),(2),(3)$
admin
3.5k
views
admin
asked
Feb 10, 2020
Graph Theory
tifr2020
engineering-mathematics
graph-theory
graph-coloring
bipartite-graph
+
–
4
votes
2
answers
35
CMI2019-A-7
An interschool basketball tournament is being held at the Olympic sports complex. There are multiple basketball courts. Matches are scheduled in parallel, with staggered timings, to ensure that spectators always have some match or other available to watch. Each match ... solve? Find a minimal colouring. Find a minimal spanning tree. Find a minimal cut. Find a minimal vertex cover.
An interschool basketball tournament is being held at the Olympic sports complex. There are multiple basketball courts. Matches are scheduled in parallel, with staggered ...
gatecse
810
views
gatecse
asked
Sep 13, 2019
Graph Theory
cmi2019
graph-theory
graph-coloring
spanning-tree
vertex-cover
descriptive
+
–
5
votes
1
answer
36
GATE Overflow | Mock GATE | Test 1 | Question: 51
... given adjacency matrix representation of a graph containing $7$ nodes (namely A , B, C, D, E, F, G). The Chromatic number of the given graph is?
$\begin{array}{|c|c|c|c|c|c|c|} \hline 0 & 1 & 1 & 0 & 1 & 1 & 0 \\ \hline 1 & 0 & 0 & 1 & 1 & 0 & 1 \\ \hline 1& 0 & 0 & 1 & 1 & 1 & 0 \\ \hline 0 & 1 & 1 & 0 & 1 & 0 & ...
Ruturaj Mohanty
1.3k
views
Ruturaj Mohanty
asked
Dec 27, 2018
Graph Theory
go-mockgate-1
numerical-answers
discrete-mathematics
graph-coloring
graph-theory
+
–
4
votes
2
answers
37
Graph Coloring
How many ways are there to color this graph from any $4$ of the following colors : Violet, Indigo, Blue, Green, Yellow, Orange and Red ? There is a condition that adjacent vertices should not be of the same color I am getting $1680$. Is it correct?
How many ways are there to color this graph from any $4$ of the following colors : Violet, Indigo, Blue, Green, Yellow, Orange and Red ?There is a condition that adjacent...
Balaji Jegan
2.6k
views
Balaji Jegan
asked
Nov 27, 2018
Graph Theory
graph-theory
graph-coloring
combinatory
+
–
3
votes
1
answer
38
Zeal Test Series 2019: Graph Theory - Graph Coloring
what is index ?
what is index ?
Prince Sindhiya
1.3k
views
Prince Sindhiya
asked
Nov 19, 2018
Graph Theory
zeal
graph-theory
graph-coloring
zeal2019
+
–
0
votes
0
answers
39
Regular graph coloring
If G is a connected k-regular graph with chromatic number k+1, then find the number of edges in G?
If G is a connected k-regular graph with chromatic number k+1, then find the number of edges in G?
dan31
1.2k
views
dan31
asked
Nov 6, 2018
Graph Theory
graph-theory
graph-coloring
+
–
3
votes
1
answer
40
Graph Coloring
A vertex colouring with four colours of a graph G = (V, E) is a mapping V → {R, G, B, Y }. So that any two adjacent vertices does not same colour. Consider the below graphs: The number of vertex colouring possible with 4 colours are _________.
A vertex colouring with four colours of a graph G = (V, E) is a mapping V → {R, G, B, Y }. So that any two adjacent vertices does not same colour. Consider the below gr...
srestha
2.0k
views
srestha
asked
Sep 21, 2018
Graph Theory
graph-theory
graph-coloring
+
–
0
votes
0
answers
41
How to find even or odd cylce in a graph
Consider this example , There is even vertices cycle as well as odd vertices cycle as per my understanding, let me know if it correct. Thanks a lot
Consider this example , There is even vertices cycle as well as odd vertices cycle as per my understanding, let me know if it correct.Thanks a lot
ejaz
519
views
ejaz
asked
Jun 30, 2018
Graph Theory
graph-coloring
+
–
1
votes
2
answers
42
Self-Doubt regarding Graph Coloring
This has reference to the below question https://gateoverflow.in/204092/gate2018-18?show=204092#q204092 My doubt is Suppose, I try to colour the vertices of this graph as follows First I colour vertex a and f with colour 1. Then I colour vertex e ... what points in mind do I need to remember so that I can colour any given graph with the minimum number of colours.
This has reference to the below questionhttps://gateoverflow.in/204092/gate2018-18?show=204092#q204092My doubt is Suppose, I try to colour the vertices of this graph as f...
Ayush Upadhyaya
1.4k
views
Ayush Upadhyaya
asked
Jun 7, 2018
Graph Theory
graph-theory
graph-coloring
+
–
32
votes
5
answers
43
GATE CSE 2018 | Question: 18
The chromatic number of the following graph is _____
The chromatic number of the following graph is _____
gatecse
12.3k
views
gatecse
asked
Feb 14, 2018
Graph Theory
graph-theory
graph-coloring
numerical-answers
gatecse-2018
1-mark
+
–
3
votes
1
answer
44
Graph Coloring
A vertex colouring with four colours of a graph G = (V, E) is a mapping V → {R, G, B, Y }. So that any two adjacent vertices does not same colour. Consider the below graphs: The number of vertex colouring possible with 4 colours are _________. ... Red and D with also blue which is other than Green, now this case is clearly violating graph coloring property. How, to solve this one?
A vertex colouring with four colours of a graph G = (V, E) is a mapping V → {R, G, B, Y }. So that any two adjacent vertices does not same colour. Consider the below gr...
Shubhanshu
1.9k
views
Shubhanshu
asked
Jan 22, 2018
Graph Theory
graph-theory
graph-coloring
+
–
8
votes
2
answers
45
MadeEasy Test Series 2018: Graph Theory - Graph Coloring
Consider the following graph: Which of the following will represents the chromatic number of the graph? answer given is 4. Please provide a detailed solution.
Consider the following graph: Which of the following will represents the chromatic number of the graph?answer given is 4.Please provide a detailed solution.
kapilbk1996
769
views
kapilbk1996
asked
Jan 11, 2018
Graph Theory
graph-theory
graph-coloring
made-easy-test-series
madeeasy-testseries-2018
+
–
9
votes
1
answer
46
Graph Colouring
The minimum number of colours required to colour the following graph, such that no two adjacent vertices are assigned the same color, is
The minimum number of colours required to colour the following graph, such that no two adjacent vertices are assigned the same color, is
Mk Utkarsh
1.1k
views
Mk Utkarsh
asked
Jan 10, 2018
Graph Theory
graph-theory
discrete-mathematics
graph-connectivity
graph-coloring
+
–
0
votes
0
answers
47
Test Series
Consider the following graph: Which of the following will represents the chromatic number of the graph? I think ans has to be 3 but given as 4
Consider the following graph:Which of the following will represents the chromatic number of the graph?I think ans has to be 3 but given as 4
akb1115
396
views
akb1115
asked
Dec 24, 2017
Graph Theory
graph-theory
graph-coloring
+
–
1
votes
0
answers
48
#GRAPH THEORY
Abhijeet_Kumar
662
views
Abhijeet_Kumar
asked
Dec 23, 2017
Graph Theory
graph-theory
discrete-mathematics
graph-coloring
+
–
30
votes
6
answers
49
TIFR CSE 2018 | Part A | Question: 9
How many ways are there to assign colours from range $\left\{1,2,\ldots,r\right\}$ to vertices of the following graph so that adjacent vertices receive distinct colours? $r^{4}$ $r^{4} - 4r^{3}$ $r^{4}-5r^{3}+8r^{2}-4r$ $r^{4}-4r^{3}+9r^{2}-3r$ $r^{4}-5r^{3}+10r^{2}-15r$
How many ways are there to assign colours from range $\left\{1,2,\ldots,r\right\}$ to vertices of the following graph so that adjacent vertices receive distinct colours?...
Rohit Gupta 8
4.6k
views
Rohit Gupta 8
asked
Dec 10, 2017
Graph Theory
tifr2018
graph-theory
graph-coloring
+
–
1
votes
2
answers
50
#Graph theory #coloring
How to find number of ways for coloring a graph with 'm' colors for following graphs a)connected graph(with no cycles) b)regular graph
How to find number of ways for coloring a graph with 'm' colors for following graphsa)connected graph(with no cycles)b)regular graph
Harish Karnam
660
views
Harish Karnam
asked
Nov 21, 2017
Graph Theory
graph-theory
graph-coloring
+
–
2
votes
0
answers
51
chromatic number
Let G be a planar Graph Such that every phase is bordered by exactly 3 edges which of the following can never be value for X(G) a)2 b)3 C)4 d)none of these
Let G be a planar Graph Such that every phase is bordered by exactly 3 edges which of the following can never be value for X(G) a)2 b)3 C)4 d)none of these
Parshu gate
1.2k
views
Parshu gate
asked
Nov 11, 2017
Graph Theory
graph-theory
discrete-mathematics
graph-connectivity
graph-coloring
+
–
0
votes
0
answers
52
GRAPH THEORY EDGE COLORING
Parshu gate
652
views
Parshu gate
asked
Nov 5, 2017
Algorithms
graph-theory
graph-coloring
edge-coloring
+
–
0
votes
0
answers
53
Chromatic polynomials
Check which of the following can be chromatic polynomials of a non-null graph ? i) x5 - 4x3 - 2x2 + x + 4 ii) x6 - 3x5 + 2x4 - 1 P.S I know for a non-null graph G, X(G) (i.e. chromatic number) is at least 2. How to proceed further ??
Check which of the following can be chromatic polynomials of a non-null graph ?i) x5 - 4x3 - 2x2 + x + 4ii) x6 - 3x5 + 2x4 - 1P.S I know for a non-null graph G, X(G) (i.e...
just_bhavana
1.5k
views
just_bhavana
asked
Oct 24, 2017
Mathematical Logic
graph-theory
graph-coloring
+
–
1
votes
0
answers
54
Graphs
We know that every 2-colourable graph is bipartite. To prove that we divide the vertices having different colors and put them separately in 2 partitions. Suppose there are n vertices in an empty graph and they are randomly colored as 1 and 2. The ones with '1' ... this be called a bipartite case even when there is no connection b/w the vertices of partition A and B? If not, why?
We know that every 2-colourable graph is bipartite. To prove that we divide the vertices having different colors and put them separately in 2 partitions.Suppose there are...
MiNiPanda
693
views
MiNiPanda
asked
Sep 30, 2017
Graph Theory
graph-coloring
+
–
1
votes
0
answers
55
Virtual Gate Test Series: Algorithms - Tree Coloring
Consider a tree with $n$ nodes where a node can be adjacent to max $4$ other nodes what is the minimum number of colors needed to color the tree so that no two adjacent nodes get the same color?
Consider a tree with $n$ nodes where a node can be adjacent to max $4$ other nodes what is the minimum number of colors needed to color the tree so that no two adjacent n...
kunalv
355
views
kunalv
asked
Sep 10, 2017
Algorithms
algorithms
graph-coloring
tree-coloring
virtual-gate-test-series
+
–
3
votes
3
answers
56
[Discrete Maths] Graph Theory Rosen,Chromatic number
What are the chromatic number of following graphs? Answer is 6 and 4 respectively.But i am getting 3 for both. Please someone confirm this?
What are the chromatic number of following graphs?Answer is 6 and 4 respectively.But i am getting 3 for both.Please someone confirm this?
rahul sharma 5
2.0k
views
rahul sharma 5
asked
Jun 12, 2017
Graph Theory
graph-theory
discrete-mathematics
graph-connectivity
graph-coloring
+
–
2
votes
2
answers
57
#Chromatic number , Planarity
Let G be a planar graph such that every face is bordered by exactly 3 edges.Which of the following can never be the value for χ(G) ? (where χ(G) is the chromatic number of G) a) 2 b) 3 c) 4 d) None of these PS : (Explain: "every face is bordered by exactly 3 edges. ")
Let G be a planar graph such that every face is bordered by exactly 3 edges.Which of the following can never be the value for χ(G) ? (where χ(G) is the chromatic number...
smartmeet
1.4k
views
smartmeet
asked
Jan 11, 2017
Graph Theory
graph-theory
discrete-mathematics
graph-coloring
+
–
Page:
« prev
1
2
3
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register