For a graph to be self-complementary, the number of vertices \( n \) must be such that \( n \equiv 0 \, (\text{mod } 4) \) or \( n \equiv 1 \, (\text{mod } 4) \). This is a necessary condition for the graph and its complement to be isomorphic.
Therefore, the correct answer is option (4).
Let \( G \) be a simple, unweighted, and undirected graph. A subset of the vertices and edges of \( G \) are shown below.
It is given that \( a - b - c - d \) is a shortest path between \( a \) and \( d \); \( e - f - g - h \) is a shortest path between \( e \) and \( h \); \( a - f - c - h \) is a shortest path between \( a \) and \( h \). Which of the following is/are NOT the edges of \( G \)?
For a two-port network to be reciprocal, it is necessary that ……..