GATE 2005
An undirected graph without self-loops or parallel edges in which every vertex is connected to every other vertex is called a:
Related Engineering Mathematics PYQs
What is the number of edges in a complete graph with 8 vertices (K8)?
If a square matrix A has det(A) = 5, what is det(A^(-1))?
If λ is an eigenvalue of an invertible square matrix A, then an eigenvalue of A^(-1) is:
If a real square matrix A satisfies A^T = A, then matrix A is:
What is the value of the limit lim (x -> ∞) (1 + 1/x)^x?
If a square matrix A has a row or column of all zeros, then det(A) is:
Free account benefits
Turn practice into measurable progress
Public PYQs and reference pages stay free. Sign in when you want GATEverse to remember what you studied and guide what to practise next.
Saved progressKeep answers, mock results and completion history across devices.
Adaptive practiceGet questions matched to your recent accuracy and difficulty level.
Bookmarks and notesBuild a personal revision list and record why a question was difficult.
Performance insightsSee weak subjects, accuracy trends, streaks and exam readiness.