SOME PROPERTIES OF SINGULARITY OF N-ARY TREE AND LINE N-ARY TREE GRAPHS

Abstract

AbstractThe idea of the high zero sum weighting which uses a maximum number of non zero independent variablesgeneralized which is equal the singularity of a graph. In a full n-ary tree Th,a,n , the edges adjacent to the rootvertex are called its children (branches). The children of the root are said to be on level 1 , if we have h levels,then for 0