| PATHS BETWEEN TWO VERTICES IN A TREE GRAPH |
| |
| 作者姓名： | LIU Guizhen |
| |
| 作者单位： | Department of Mathematics，Shandong University，Jinan 250100，China |
| |
| 摘 要： | Let T(G)be the tree graph of a simple graph G.It is proved that ifT and T′are two vertices of T(G)such that d_T(G)(T)(?)d_T(G}(T′),then there ared_T(G)(T) internally disjoint paths in T(G) joining T and T′.
|
PATHS BETWEEN TWO VERTICES IN A TREE GRAPH |
| |
| LIU Guizhen.PATHS BETWEEN TWO VERTICES IN A TREE GRAPH[J].Journal of Systems Science and Complexity,1992(2). |
| |
| Authors: | LIU Guizhen |
| |
| Abstract: | |
| |
| Keywords: | Tree graph path connectivity |
| 本文献已被 CNKI 等数据库收录！ |
