Register
Webpage for Graph Theory:

Recent questions tagged graph-theory

0 votes
1 answer
1
ISI kolkata MTech CS 2019
Let $K_n$ denote the complete graph on $n$ vertices, with $n ≥ 3$, and let $u$, $v$, $w$ be three distinct vertices of $K_n$. Determine the number of distinct paths from $u$ to $v$ that do not contain the vertex $w$.
Let $K_n$ denote the complete graph on $n$ vertices, with $n ≥ 3$, and let $u$, $v$, $w$ be three distinct vertices of $K_n$. Determine the number of distinct paths fro...
User Avatar
0 votes
1 answer
3
#algorithm
how many spanning trees are possible for complete graph of 4 vertices
how many spanning trees are possible for complete graph of 4 vertices
User Avatar
1 votes
3 answers
6
GATE CSE 2024 | Set 2 | Question: 50
The chromatic number of a graph is the minimum number of colours used in a proper colouring of the graph. The chromatic number of the following graph is __________.
The chromatic number of a graph is the minimum number of colours used in a proper colouring of the graph. The chromatic number of the following graph is __________.
User Avatar
2 votes
2 answers
7
GATE CSE 2024 | Set 1 | Question: 24
The number of spanning trees in a complete graph of $4$ vertices labelled $\text{A, B, C,}$ and $\text{D}$ is _________.
The number of spanning trees in a complete graph of $4$ vertices labelled $\text{A, B, C,}$ and $\text{D}$ is _________.
User Avatar
0 votes
1 answer
16
ISRO 2024
Maximum number of Simple graphs possible with $n$ vertices $2^{n(n-1)/2}$ $2^{(n-1)/2}$ $2^{n(n+1)/2}$ $2^{n(n+1)}$
Maximum number of Simple graphs possible with $n$ vertices$2^{n(n-1)/2}$$2^{(n-1)/2}$$2^{n(n+1)/2}$$2^{n(n+1)}$
User Avatar
0 votes
1 answer
17
ISRO 2024
If there are five faces and nine vertices in an undirected planar graph, then number of edges is 14 6 12 None of the above
If there are five faces and nine vertices in an undirected planar graph, then number of edges is14612None of the above
User Avatar
0 votes
0 answers
19
Which study material to refer to so that one can solve the theory questions on Graphs topic asked in PYQs
I have not been able to answer many of the Graph theory questions, I feel my comprehension of the topic is inadequate, could someone guide me to some reference material I...
User Avatar
0 votes
0 answers
21
Find the MIS and MaxIS
User Avatar
0 votes
1 answer
22
#self doubt
Domination set and MIS are the same?
Domination set and MIS are the same?
User Avatar
0 votes
1 answer
23
Regular and complete graph
which of the following statements is true: a complete graph is $(N-1)$ regular a $(N-1)$ regular is a complete graph
which of the following statements is true:a complete graph is $(N-1)$ regulara $(N-1)$ regular is a complete graph
User Avatar
0 votes
0 answers
24
#self_doubt#pyq#graphtheory
Let G be a complete undirected graph on 6 vertices. If vertices of G are labeled, then the number of distinct cycles of length 4 in G is equal to the answer is 45 but for the following cases, what will be the answer? 1- if the graph is directed 2- if vertices are not labeled.
Let G be a complete undirected graph on 6 vertices. If vertices of G are labeled, then the number of distinct cycles of length 4 in G is equal tothe answer is 45 but for ...
User Avatar
0 votes
1 answer
25
#applied course
how many regions are in the above graph and please explain with region formula also. r=e-v+(c+1) my attempt is : r=5-5+2 r=2 but the rule is twice the no of boundary edges which is (5*2) = sum of region degrees which (4+5=9 ) can someone explain where the fault is
how many regions are in the above graph and please explain with region formula also.r=e-v+(c+1)my attempt is :r=5-5+2r=2but the rule is twice the no of boundary edges whi...
User Avatar
0 votes
1 answer
26
made easy test series
Suppose A is a 12 by 9 incidence matrix from a connected (but unknown) graph with 9 nodes and 12 edges. The diagonal entries of $A^{T}.A$ give the number of edges into each node. Then, what is the sum of those diagonal entries ________.
Suppose A is a 12 by 9 incidence matrix from a connected (but unknown) graph with 9 nodes and 12 edges. The diagonal entries of $A^{T}.A$give the number of edges into eac...
User Avatar
0 votes
1 answer
27
Self doubt
How many simple directed (unweighted) graphs on the set of vertices {v0,v1,…v5} are there that have at most one edge between any pair of vertices? (That is, for two vertices a, b, only at most one of the edges (a, b) and (b, a) is in the graph.)
How many simple directed (unweighted) graphs on the set of vertices {v0,v1,…v5} are there that have at most one edge between any pair of vertices? (That is, for two ver...
User Avatar
Page: