Highest voted questions in Engineering Mathematics

46 votes
6 answers
123
The minimum number of colours required to colour the vertices of a cycle with $n$ nodes in such a way that no two adjacent nodes have the same colour is$2$$3$$4$$n-2 \lef...
46 votes
3 answers
124
45 votes
3 answers
128
Let $A$ be an $n \times n$ matrix of the following form.$$A = \begin{bmatrix}3&1&0&0&0&\ldots&0&0&0\\1&3&1&0&0&\ldots&0&0&0\\0&1&3&1&0&\ldots&0&0&0\\0&0&1&3&1&\ldots&0&0&...
44 votes
9 answers
132
$G$ is an undirected graph with $n$ vertices and $25$ edges such that each vertex of $G$ has degree at least $3$. Then the maximum possible value of $n$ is _________ .
44 votes
11 answers
133
43 votes
2 answers
137
The number of possible commutative binary operations that can be defined on a set of $n$ elements (for a given $n$) is ___________.
43 votes
4 answers
139