|
|||||
|
|
English Decycling Number of Some Graphs |
|
| Authors: | ERLING WEI YANPEI LIU |
| Abstract: | The decycling number of a graph is defined to be the minimum number of venicesthat must be removed in order to eliminate all of the cycles in the graph. In this paper,we discuss the decycling number of joint graph. FOr general graphs G1, G2, the upperbound of the decycling number of joint graph G1[G2] is provided and for some specialgraphs G1, G2, the exact decycling number of the joint graph G1 [G2] is provided too. |
| Keywords: | joint graph independence number decycling set |
| 本文献已被 CNKI 等数据库收录！ | |