Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged graph-isomorphism
3
votes
1
answer
1
GO Classes 2023 | IIITH Mock Test 1 | Question: 42
Which of the following statements are correct? The complement of a simple disconnected graph must be connected. The complement of a simple connected graph must be disconnected. The complement of complete bipartite graph $\text{K}(4,6)$ has $10$ components. ... its complement. Then $\text{G}$ must have $4k$ or $4k + 1$ vertices for some integer $k.$
Which of the following statements are correct?The complement of a simple disconnected graph must be connected.The complement of a simple connected graph must be disconnec...
GO Classes
585
views
GO Classes
asked
Mar 26, 2023
Graph Theory
goclasses2023-iiith-mock-1
goclasses
graph-theory
graph-isomorphism
multiple-selects
1-mark
+
–
4
votes
1
answer
2
GO Classes Scholarship 2023 | Test | Question: 12
How many non-isomorphic simple undirected graphs are there, each with four vertices and without a cycle?
How many non-isomorphic simple undirected graphs are there, each with four vertices and without a cycle?
GO Classes
751
views
GO Classes
asked
Aug 6, 2022
Graph Theory
goclasses-scholarship-test1
numerical-answers
goclasses
graph-theory
graph-isomorphism
2-marks
+
–
5
votes
1
answer
3
GO Classes Test Series 2024 | Discrete Mathematics | Test 5 | Question: 2
Let $\text{G}$ be the following set of undirected connected graphs $:$ $\text{G} = \{ g \mid g \;\text{is a complete graph on}\; n\; \text{vertices where}\; 1\leq n \leq 10 \;\text{OR} \;g$ is a cycle graph on ... $a$ is isomorphic to $b.$ How many equivalence classes will be there for $\text{R}?$
Let $\text{G}$ be the following set of undirected connected graphs $:$$\text{G} = \{ g \mid g \;\text{is a complete graph on}\; n\; \text{vertices where}\; 1\leq n \leq 1...
GO Classes
473
views
GO Classes
asked
May 11, 2022
Graph Theory
goclasses2024-dm-5-weekly-quiz
numerical-answers
goclasses
graph-theory
graph-isomorphism
1-mark
+
–
2
votes
1
answer
4
GO Classes Test Series 2024 | Discrete Mathematics | Test 5 | Question: 22
Which of the following statements are correct? The complement of a simple disconnected graph must be connected. The complement of a simple connected graph must be disconnected. The complement of complete bipartite graph $\text{K}(4,6)$ ... . Then $\text{G}$ must have $4k$ or $4k + 1$ vertices for some integer $k.$
Which of the following statements are correct?The complement of a simple disconnected graph must be connected.The complement of a simple connected graph must be disconnec...
GO Classes
275
views
GO Classes
asked
May 11, 2022
Graph Theory
goclasses2024-dm-5-weekly-quiz
goclasses
graph-theory
graph-isomorphism
multiple-selects
2-marks
+
–
14
votes
2
answers
5
GATE CSE 2022 | Question: 40
The following simple undirected graph is referred to as the Peterson graph. Which of the following statements is/are $\text{TRUE}?$ The chromatic number of the graph is $3.$ The graph has a Hamiltonian path. The following graph is isomorphic to the Peterson ... $3.$ (A subset of vertices of a graph form an independent set if no two vertices of the subset are adjacent.)
The following simple undirected graph is referred to as the Peterson graph.Which of the following statements is/are $\text{TRUE}?$The chromatic number of the graph is $3....
Arjun
7.6k
views
Arjun
asked
Feb 15, 2022
Graph Theory
gatecse-2022
graph-theory
graph-isomorphism
multiple-selects
2-marks
+
–
1
votes
1
answer
6
Homomorphic and Isomorphic graph
This a random question came into my mind… Are the below statements true: 1] If a graph is Homomorphic to our graph then it is also Isomorphic to that graph. 2]If a graph is Isomorphic to our graph then it is also Homomorphic graph.
This a random question came into my mind…Are the below statements true:1] If a graph is Homomorphic to our graph then it is also Isomorphic to that graph.2]If a graph i...
Nandkishor3939
1.1k
views
Nandkishor3939
asked
Jan 21, 2019
Set Theory & Algebra
graph-isomorphism
graph-theory
group-theory
+
–
1
votes
0
answers
7
What to study & from where to study - Graph Theory for GATE 2019.
Are the following topics necessary/ apt to study for gate.(Bold items are explicitly mentioned in gate syllabus document) Connectivity Matching Coloring Cuts Covering Independent Sets Planar Graphs Isomorphism Walks, Trails, Paths, ... taking a lot of time. Can anyone please recommend a reliable and simple resource to go with.
Are the following topics necessary/ apt to study for gate.(Bold items are explicitly mentioned in gate syllabus document)ConnectivityMatchingColoringCutsCoveringIndepende...
Krishna Sai Vootla
2.0k
views
Krishna Sai Vootla
asked
Dec 29, 2018
Graph Theory
syllabus
engineering-mathematics
graph-theory
graph-planarity
graph-isomorphism
vertex-cover
+
–
1
votes
2
answers
8
Show that the two graphs are isomorphic (Narsingh Deo)
Show that the two graphs are isomorphic
Show that the two graphs are isomorphic
Mk Utkarsh
5.6k
views
Mk Utkarsh
asked
Apr 15, 2018
Graph Theory
graph-theory
narsingh
deo
graph-isomorphism
+
–
7
votes
3
answers
9
GATE CSE 1988 | Question: 13iii
Are the two digraphs shown in the above figure isomorphic? Justify your answer.
Are the two digraphs shown in the above figure isomorphic? Justify your answer.
go_editor
1.3k
views
go_editor
asked
Dec 20, 2016
Graph Theory
normal
gate1988
descriptive
graph-theory
graph-isomorphism
out-of-gate-syllabus
+
–
0
votes
0
answers
10
Iso-morphic || Non-Isomorphic Graphs
The Number of Non-Isomorphic simple graphs upto 5 Nodes is _______
The Number of Non-Isomorphic simple graphs upto 5 Nodes is _______
SKP
1.3k
views
SKP
asked
Dec 1, 2016
Graph Theory
graph-isomorphism
+
–
2
votes
2
answers
11
GATE CSE 1987 | Question: 2f
State whether the following statements are TRUE or FALSE: Every infinite cyclic group is isomorphic to the infinite cyclic group of integers under addition.
State whether the following statements are TRUE or FALSE:Every infinite cyclic group is isomorphic to the infinite cyclic group of integers under addition.
makhdoom ghaya
930
views
makhdoom ghaya
asked
Nov 9, 2016
Graph Theory
gate1987
graph-theory
graph-isomorphism
true-false
out-of-gate-syllabus
+
–
2
votes
2
answers
12
UGC NET CSE | June 2014 | Part 2 | Question: 21
Consider the graph given below as : Which one of the following graph is isomorphic to the above graph ?
Consider the graph given below as :Which one of the following graph is isomorphic to the above graph ?
makhdoom ghaya
3.5k
views
makhdoom ghaya
asked
Jun 27, 2016
Graph Theory
ugcnetcse-june2014-paper2
graph-theory
non-gate
graph-isomorphism
+
–
5
votes
2
answers
13
TIFR CSE 2015 | Part B | Question: 13
Two undirected graphs $G_{1}=(V_{1}, E_{1})$ and $G_{2}= (V_{2}, E_{2})$ are said to be isomorphic if there exist a bijection $\pi: V_{1} \rightarrow V_{2}$ such that for all $u, v \in V_{1}, (u, v) \in E_{1}$ ... $L$ is $NP$- hard. $L$ is undecidable. Only $(i)$ Only $(ii)$ Only $(iii)$ $(i)$ and $(ii)$ $(ii)$ and $(iii)$
Two undirected graphs $G_{1}=(V_{1}, E_{1})$ and $G_{2}= (V_{2}, E_{2})$ are said to be isomorphic if there exist a bijection $\pi: V_{1} \rightarrow V_{2}$ such that for...
makhdoom ghaya
1.0k
views
makhdoom ghaya
asked
Dec 8, 2015
Algorithms
tifr2015
graph-theory
graph-isomorphism
p-np-npc-nph
non-gate
+
–
2
votes
1
answer
14
Given no of vertex & edges how to find no of Non Isomorphic graphs possible ?
Assume that ‘e’ is the number of edges and n is the number of vertices. The number of non-isomorphic graphs possible with n-vertices such that graph is 3-regular graph and e = 2n – 3 are ... ? , this is real question ! Is there any algorithm for this ? From Made Easy FLT 6-Practice Test 14
Assume that ‘e’ is the number of edges and n is the number of vertices. The number of non-isomorphic graphs possible with n-vertices such that graph is 3-regu...
Akash Kanase
2.3k
views
Akash Kanase
asked
Dec 1, 2015
Graph Theory
graph-theory
graph-isomorphism
+
–
1
votes
2
answers
15
Whether the given pair of graphs is isomorphic?Pls provide a rigorous argument.
अनुराग पाण्डेय
5.9k
views
अनुराग पाण्डेय
asked
Jun 30, 2015
Graph Theory
graph-isomorphism
+
–
28
votes
6
answers
16
GATE CSE 2015 Set 2 | Question: 28
A graph is self-complementary if it is isomorphic to its complement. For all self-complementary graphs on $n$ vertices, $n$ is A multiple of 4 Even Odd Congruent to 0 $mod$ 4, or, 1 $mod$ 4.
A graph is self-complementary if it is isomorphic to its complement. For all self-complementary graphs on $n$ vertices, $n$ isA multiple of 4EvenOddCongruent to 0 $mod$ 4...
go_editor
13.7k
views
go_editor
asked
Feb 12, 2015
Graph Theory
gatecse-2015-set2
graph-theory
graph-isomorphism
out-of-syllabus-now
+
–
5
votes
1
answer
17
maths_mock_test
How many labelled sub-graphs of $K_n$ are isomorphic to $W_{n-1}$? (Where $K_n$ : Complete graph with $n$ vertices , $W_n$ : Wheel graph with $ n+1$ vertices) 1.$\frac{(n-1)!}{2}$ 2. $\frac{(n-2)!}{2}$ 3. $\frac{n!}{2(n-1)}$ 4. $\frac{n!}{2(n-1)^2}$
How many labelled sub-graphs of $K_n$ are isomorphic to $W_{n-1}$?(Where $K_n$ : Complete graph with $n$ vertices , $W_n$ : Wheel graph with $ n+1$ vertices)1.$\frac{(n-1...
Vikrant Singh
880
views
Vikrant Singh
asked
Feb 1, 2015
Graph Theory
graph-theory
graph-isomorphism
out-of-syllabus-now
+
–
42
votes
6
answers
18
GATE CSE 2014 Set 2 | Question: 51
A cycle on $n$ vertices is isomorphic to its complement. The value of $n$ is _____.
A cycle on $n$ vertices is isomorphic to its complement. The value of $n$ is _____.
go_editor
17.5k
views
go_editor
asked
Sep 28, 2014
Graph Theory
gatecse-2014-set2
graph-theory
numerical-answers
normal
graph-isomorphism
non-gate
+
–
29
votes
4
answers
19
GATE CSE 2012 | Question: 26
Which of the following graphs is isomorphic to
Which of the following graphs is isomorphic to
Arjun
11.1k
views
Arjun
asked
Sep 25, 2014
Graph Theory
gatecse-2012
graph-theory
graph-isomorphism
normal
non-gate
+
–
To see more, click for the
full list of questions
or
popular tags
.
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register