
IOSR Journal of Mathematics (IOSR-JM)
... This means that, every number having digital root 1 when multiplied by a number having digital root 1 shall result in a number having digital root 1. And similarly, all the number with digital root 5 when multiplied with a number having a digital root is equal to 2 shall result in a number having di ...
... This means that, every number having digital root 1 when multiplied by a number having digital root 1 shall result in a number having digital root 1. And similarly, all the number with digital root 5 when multiplied with a number having a digital root is equal to 2 shall result in a number having di ...
Sathyabama Univarsity B.E April 2010 Discrete Mathematics
... (b) By using any method of proving, show that R S follows logically from the premises C D, (C D) ~ H, ~ H (A ~ B) and (A ~ B) (R S). 13. (a) Let X = {1, 2, 3,….,25} and R = {(x, y)/ x – y is divisible by 5} be a relation in X. Show that R is an equivalence relation. (b) Let A, B, a ...
... (b) By using any method of proving, show that R S follows logically from the premises C D, (C D) ~ H, ~ H (A ~ B) and (A ~ B) (R S). 13. (a) Let X = {1, 2, 3,….,25} and R = {(x, y)/ x – y is divisible by 5} be a relation in X. Show that R is an equivalence relation. (b) Let A, B, a ...
A Short Proof for Chen`s Alternative Kneser Coloring Lemma
... Proof. For a q-coloring c of G, a cycle C = (v0 , v1 , . . . , vn−1 , v0 ) is called tight if c(vi+1 ) ≡ c(vi ) + 1 (mod q) for i = 0, 1, . . . , n − 1, where the indices of the vertices are modulo n. It is known [8] that χc (G) = q if and only if G is q-colorable and every q-coloring of G has a tig ...
... Proof. For a q-coloring c of G, a cycle C = (v0 , v1 , . . . , vn−1 , v0 ) is called tight if c(vi+1 ) ≡ c(vi ) + 1 (mod q) for i = 0, 1, . . . , n − 1, where the indices of the vertices are modulo n. It is known [8] that χc (G) = q if and only if G is q-colorable and every q-coloring of G has a tig ...