Bissoy.com
Doctors Medicines MCQs Q&A

A ______ is a graph which has the same number of edges as its complement must have number of vertices congruent to 4m or 4m modulo 4(for integral values of number of edges).

A ______ is a graph which has the same number of edges as its complement must have number of vertices congruent to 4m or 4m modulo 4(for integral values of number of edges). Correct Answer Self complementary graph

It is the definition of self complementary graph. It is a graph that is isomorphic to its complement.

Related Questions

A graph which has the same number of edges as its complement must have number of vertices congruent to ______ or _______ modulo 4(for integral values of number of edges).
The line graph L(G) of a simple graph G is defined as follows: There is exactly one vertex v(e) in L(G) for each edge e in G. For any two edges e and e' in G, L(G) has an edge between v(e) and v(e'), if and only if e and e' are incident with the same vertex in G. Which of the following statements is/are TRUE? (P) The line graph of a cycle is a cycle. (Q) The line graph of a clique is a clique. (R) The line graph of a planar graph is planar. (S) The line graph of a tree is a tree.
If a simple graph G, contains n vertices and m edges, the number of edges in the Graph G'(Complement of G) is ___________
An undirected graph has 8 vertices labelled 1, 2, …,8 and 31 edges. Vertices 1, 3, 5, 7 have degree 8 and vertices 2, 4, 6, 8 have degree 7. What is the degree of vertex 8?
To constitute a matter of res judicata which of the following conditions must concur?
1. The matter directly and substantially in issue in the subsequent suit or issue must be the same matter which was directly and substantially in issue either actually (section 11, explanation III) or constructively (section 11, explanation IV) in the former suit
2. The former suit must have been a suit between the same parties under whom they or any of them claim. Explanation VI of Section 11 must be read with this condition
3. The parties as aforesaid must have litigated under the same title in the former suit
4. The court which decided the former suit must have been a court competent to try the subsequent suit of the suit in which such issue has been subsequently raised. Explanation II of section 11 is to be read with condition
5. The matter directly and substantially in issue in the subsequent suit must have been heard and finally decided by the court in the first suit. Explanation V of section 11 is to be read with this condition
What is the number of vertices in an undirected connected graph with 39 edges, 7 vertices of degree 2, 2 vertices of degree 5 and remaining of degree 6?
Which of the following statements regarding tree are correct? (A) All the links of a tree together does not constitute the complement of the corresponding tree (B) A connected subgraph of a connected graph is a tree if there exist (n - 1) nodes of the group (C) A connected subgraph of a connected graph is a tree if there exist many paths between any pair of nodes in it (D) The number of terminal nodes of end vertices of every tree are atleast two (E) Every connected graph has atleast one tree Choose the correct answer from the options given below: (1) (A) and (B) only (2) (B) and (C) only (3) (B) and (D) only (4) (D) and (E) only
Which of the following is/are not true for a triangular pyramid? (a) Triangular pyramid has six faces. (b) Triangular pyramid has four vertices. (c) Triangular pyramid has six edges. (d) The sum of the number of faces, vertices and edges of a triangular pyramid is 14. (e) Triangular pyramid is also known as a tetrahedron.
Suppose a database schedule 5 involves transactions T1, T2, .............Tn Consider the precedence graph of S with vertices representing the transactions and edges representing the conflicts. If S is serializable, which one of the following orderings of the vertices of the precedence graph is guaranteed to yield a serial schedule ?
Suppose a database schedule S involves transactions T1, …,Tn. Construct the precedence graph of S with vertices representing the transactions and edges representing the conflicts. If S is serializable, which one of the following orderings of the vertices of the precedence graph is guaranteed to yield a serial schedule?