“…A switching function f(x 1, x 2 ,…………,x n ) is called totally symmetric with respect to the variables x 1 , x 2 , x 3 ,……….,x n , [11]- [18], if it is invariant under any permutation of the variables. Total symmetry can be specified by a set of integers (called a numbers) A = (a i ,…..,a j,……… ,a k ) where A ⊂ (0,1,2,….,n); all the vertices with weight w∈A will appear as true minterms in the function.…”