Skip to content
Early access — you're among the first to try PYQLabs. Share feedback
Concept drill

counting-edges

GATE CSE & IT · Graph Theory · 2014-2014

1
PYQs
0%
keyed
0
elite explanations
1
years appeared

Study anchor

Rosen — Discrete Mathematics and Its Applications

Discrete structures, counting, relations, graph theory

Practice action

Start latest PYQ

PYQs in this concept

All concepts →
2014 PYQ

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\}.$$ Th...

medium