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______ A_i_$_h asked Nov 27, 2017 edited Dec 16, 2017 by A_i_$_h A_i_$_h 447 views answer comment Share Follow See all 4 Comments See all 4 4 Comments reply Ashwani Kumar 2 commented Nov 27, 2017 reply Follow Share 1012 edges 0 votes 0 votes Rishabh Gupta 2 commented Nov 27, 2017 reply Follow Share 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 votes 0 votes Ashwani Kumar 2 commented Nov 27, 2017 reply Follow Share 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 votes 0 votes A_i_$_h commented Dec 16, 2017 reply Follow Share @ashwani There is an edge from (a,b) to (c,d) if |a−c|≤1 and |b−d|≤1. note this modification :) edited 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes Is answer 121?? Priyadrasta Raut answered Feb 18, 2019 Priyadrasta Raut comment Share Follow See all 0 reply Please log in or register to add a comment.