‎‎We derive a new sharp lower bound on the $k$-conversion number of graphs of maximum degree $k+1$‎. ‎This generalizes a result of W.~Staton [Induced forests in cubic graphs‎, ‎Discrete Math.‎,49 ...

A linear $ [n,k]_q $ code $ C $ is said to be a full weight spectrum (FWS) code if there exist codewords of each weight less than or equal to $ n $. In this brief communication we determine necessary and sufficient conditions ...

A fall coloring of a graph $G$ is a proper‎ ‎ coloring of $G$ with $k$ colors such that each vertex sees ‎all $k$‎ colors on its closed neighborhood‎. ‎In this paper‎, ‎we characterize ‎‎‎all fall colorings of Kneser graphs ...