期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
ON LOCALLY n-(ARC) STRONGLY CONNECTED DIGRAPHS
1
作者 陈治柏 《Chinese Science Bulletin》 SCIE EI CAS 1986年第20期1435-,共1页
In 1974 G. Chartrand et al. introduced the concept of locally n-connected graphs. In. this letter we generalize this concept to digraphs (The digraph D is locally n-(arc) strongly connected if for each vertex v, the s... In 1974 G. Chartrand et al. introduced the concept of locally n-connected graphs. In. this letter we generalize this concept to digraphs (The digraph D is locally n-(arc) strongly connected if for each vertex v, the subdigraph induced by the vertices adjacent to v is n-(arc) strongly connected.) and establish the following theorems. 展开更多
关键词 CONNECTED VERTEX LOCALLY generalize LETTER latter ARC ON LOCALLY n CONNECTIVITY deter
原文传递
THE BOUND OF THE MAXIMUM NUMBER OF END VERTICES OF SPANNING TREES
2
作者 张福基 陈治柏 《Chinese Science Bulletin》 SCIE EI 1988年第14期1149-1151,共3页
Schuster, Cai Maocheng and Lin Yixun studied the interpolation theory for the number of end vertices of spanning trees of graph. Zhang Fuji and Guo Xiaofeng obtained the related result of digraph. This paper is devote... Schuster, Cai Maocheng and Lin Yixun studied the interpolation theory for the number of end vertices of spanning trees of graph. Zhang Fuji and Guo Xiaofeng obtained the related result of digraph. This paper is devoted to find the upper and lower bounds of the maximum number of end vertices of spanning (directed) trees for directed or undirected graphs. Our result is connected with some parameters in graph theory such as cyclomatic number and absorption number. For our purpose, 展开更多
关键词 GRAPH spanning tree end vertices
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部