Register
Webpage for Graph Theory:

Recent questions tagged graph-theory

0 votes
2 answers
241
ME test series question on graph theory
User Avatar
0 votes
0 answers
245
Made Easy
What are all the conditions for the degree sequence to be graphic?
What are all the conditions for the degree sequence to be graphic?
User Avatar
2 votes
1 answer
246
MadeEasy Subject Test 2019: Graph Thoery - Graph Coloring
The number of vertices,edges and colors required for proper coloring in Tripartite graph K<3,2,5> will be : 10 , 31 , 3 10 , 30 , 3 10 , 30 , 2 None
The number of vertices,edges and colors required for proper coloring in Tripartite graph K<3,2,5 will be :10 , 31 , 310 , 30 , 310 , 30 , 2None
User Avatar
0 votes
1 answer
249
CUT VERTEX
plz solve this problem..
plz solve this problem..
User Avatar
0 votes
1 answer
251
Made_easy_test_series
The number of totally ordered sets compatible to the given POSET are ________.
The number of totally ordered sets compatible to the given POSET are ________.
User Avatar
0 votes
0 answers
252
simple graph formula
why in this planar graph this theorem ,”sum of degrees of faces or regions is twice the number of edges” is not true as it should hold for all planar graphs?? Note: numbers denote region or face
why in this planar graph this theorem ,”sum of degrees of faces or regions is twice the number of edges” is not true as it should hold for all planar graphs??Note: nu...
User Avatar
0 votes
0 answers
254
self doubt
If A = {1,2,3 …. n} then how many multisets of size 4 are possible ,such that atleast of the elements appears twice.
If A = {1,2,3 …. n}then how many multisets of size 4 are possible ,such that atleast of the elements appears twice.
User Avatar
0 votes
0 answers
258
#graph
why DFS cannot find shortest path but BFS can?
why DFS cannot find shortest path but BFS can?
User Avatar
5 votes
1 answer
261
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 & ...
User Avatar
0 votes
2 answers
263
In a 3-array tree if internal nodes have exactly 3 children,the number of leaf nodes will be __ ?
In a 3-array tree if internal nodes have exactly 3 children,the number of leaf nodes will be __ ? Does it vary for binary tree? What do you mean by internal nodes? Non root node and leaf node?
In a 3-array tree if internal nodes have exactly 3 children,the number of leaf nodes will be __ ?Does it vary for binary tree?What do you mean by internal nodes? Non roo...
User Avatar
0 votes
3 answers
264
Doubt [Graph Theory]
Is it possible that a disconnected graph be an Euler graph ?
Is it possible that a disconnected graph be an Euler graph ?
User Avatar
1 votes
0 answers
267
Planar graph
In a connected 3 regular graph, every planar region is bounded by exactly 5 edges, then count no of edges?
In a connected 3 regular graph, every planar region is bounded by exactly 5 edges, then count no of edges?
User Avatar
0 votes
1 answer
268
Self doubt
Is this graph Euler?
Is this graph Euler?
User Avatar
1 votes
1 answer
269
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.
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.
User Avatar
Page: