SOME PROPERTIES OF SINGULARITY OF N-ARY TREE AND LINE N-ARY TREE GRAPHS | ||
| Tikrit Journal of Pure Science | ||
| Article 1, Volume 19, Issue 1, April 2014, Pages 159-166 | ||
| Author | ||
| Payman A. Rashed | ||
| Abstract | ||
| Abstract The idea of the high zero sum weighting which uses a maximum number of non zero independent variables generalized which is equal the singularity of a graph. In a full n-ary tree Th,a,n , the edges adjacent to the root vertex 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 Keywords Tree Graphs n-ary Tree singularity Line n-ary Tree | ||
| Keywords | ||
| Tree Graphs n; ary Tree singularity Line n; ary Tree | ||
|
Statistics Article View: 182 PDF Download: 25 |
||