edited by
447 views
2 votes
2 votes

Consider an directed graph G where self-loops are not allowed. The vertex set of G is {(i,j)∣1≤i≤12,1≤j≤12}There is an edge from(a,b) to (c,d) if |a−c|≤1 and |b−d|≤1. The number of edges in this graph is______

edited by

1 Answer

Related questions

100 votes
100 votes
10 answers
1
57 votes
57 votes
11 answers
2
go_editor asked Sep 28, 2014
18,179 views
If $G$ is the forest with $n$ vertices and $k$ connected components, how many edges does $G$ have?$\left\lfloor\frac {n}{k}\right\rfloor$$\left\lceil \frac{n}{k} \right\r...
42 votes
42 votes
6 answers
3
go_editor asked Sep 28, 2014
17,309 views
A cycle on $n$ vertices is isomorphic to its complement. The value of $n$ is _____.
5 votes
5 votes
2 answers
4
Souvik33 asked Jan 15, 2023
1,095 views
Consider the function func shown below: int func(int num) { int count = 0; while (num) { count++; num>>= 1; } return (count); }The value returned by func(-435) is:69Will ...