recategorized by
3,901 views

4 Answers

Best answer
11 votes
11 votes
$$\begin{array}{|c|c|c|c|c|c|} \hline \textbf{} & \textbf{$P_1$}& \textbf{$P_2$} & \textbf{$P_3$} & \textbf{$P_4$} & \textbf{$P_5$}\\\hline \textbf{$P_1$} & \text{$0$}& \text{$1$} & \text{$0$} & \text{$0$} & \text{$1$}\\\hline \textbf{$P_2$} & \text{$0$}& \text{$0$} & \text{$0$} & \text{$1$} & \text{$0$}  \\\hline \textbf{$P_3$} & \text{$1$}& \text{$0$} & \text{$0$} & \text{$0$} & \text{$0$}  \\\hline \textbf{$P_4$} & \text{$0$}& \text{$0$} & \text{$1$} & \text{$0$} & \text{$1$} \\\hline \textbf{$P_5$} & \text{$0$}& \text{$1$} & \text{$0$} & \text{$0$} & \text{$0$} \\\hline \end{array}$$
edited by
3 votes
3 votes
put $1$ in all places in adjacency marix according to direction given in edges for ex $p1$ to $p5$ there is path going so put $1$ in $p1$ row and $p5$ col but don't put $1$ in $p5$ to $p1$ because there is no path
edited by
0 votes
0 votes

This is also a possibility based on the convention given in “Introduction to Graph Theory” by Douglas West.

Related questions

7 votes
7 votes
3 answers
1
go_editor asked Dec 20, 2016
1,211 views
Are the two digraphs shown in the above figure isomorphic? Justify your answer.
1 votes
1 votes
0 answers
2
go_editor asked Dec 20, 2016
477 views
Verify whether the following mapping is a homomorphism. If so, determine its kernel.$\overline{G}=G$