in Graph Theory edited by
335 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______

in Graph Theory edited by
by
335 views

4 Comments

1012 edges
0
0

For directed graph you cannot say that an edge is between x and y. You need to mention that the edge is from x to y or from y to x or both.

0
0

Yes it is given edge is between (a,b) and (c,d) not from (a,b) to (c,d) or (c,d) or both so I assumed it to be both the sides like two directed edges for one undirected edge, one in each direction. 

I have never seen between in case of directed edges.

0
0

@ashwani

There is an edge from (a,b) to (c,d) if |a−c|≤1 and |b−d|≤1.

note this modification :) edited

0
0

1 Answer

0 votes
0 votes
Is answer 121??

Related questions