1
GATE CSE 2014 Set 1
Numerical
+2
-0
Consider an undirectional graph $$G$$ where self-loops are not allowed. The vertex set of $$G$$ is $$\left\{ {\left( {i,j} \right):\,1 \le i \le 12,\,1 \le j \le 12} \right\}.$$ There is an edge between $$(a,b)$$ and $$(c,d)$$ if $$\left| {a - c} \right| \le 1$$ and $$\left| {b - d} \right| \le 1$$. The number of edges in this graph is _____.
2
GATE CSE 2013
+2
-0.6
The line graph $$L(G)$$ of a simple graph $$G$$ is defined as follows:

$$\,\,\,\,$$There is exactly one vertex $$v(e)$$ in $$L$$(G)$$for each edge$$e$$in$$G\,\,\,\,$$For any two edges$$e$$and$$e'$$in$$G$$,$$L(G)$$has an edge between$$v(e)$$and$$v(e')$$, if and only if$$e$$and$$e'\,\,\,\,$$Which of the following statements is/are TRUE? (P) The line graph of a cycle is a cycle. (Q) The line graph of a clique is a clique. (R) The line graph of a planar graph is planar. (S) The line graph of a tree is a tree. A P only B P and R only C R only D P, Q and S only 3 GATE CSE 2012 MCQ (Single Correct Answer) +2 -0.6 Which of the following graphs is isomorphic to A B C D 4 GATE CSE 2012 MCQ (Single Correct Answer) +2 -0.6 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 A$$15$$B$$30$$C$$90$$D$$360
GATE CSE Subjects
EXAM MAP
Medical
NEET