期刊文献+
共找到3篇文章
< 1 >
每页显示 20 50 100
无限循环图的超边连通性(英文) 被引量:1
1
作者 张昭 孟吉翔 《应用数学》 CSCD 北大核心 2002年第S1期68-71,共2页
本文证明了 ,在一切具有有限跃度序列的无限循环图中 ,只有C( 1 ) ,C( 1 ,2 )和C( 1 ,2 ,3)不是超边连通的 ,而且C( 1 )和C( 1 ,2 )是其中仅有的两个非最大边连通图 .
关键词 无限循环图 超边连通性
全文增补中
INFINITE CIRCULANTS AND THEIR PROPERTIES 被引量:1
2
作者 张福基 黄琼湘 《Acta Mathematicae Applicatae Sinica》 SCIE CSCD 1995年第3期280-284,共5页
In recent years diverse literatures have been published on circulants (cf. [2] and the references cited therein). In this paper we consider the infinite analogues of circulant and random infinite circulant, and their ... In recent years diverse literatures have been published on circulants (cf. [2] and the references cited therein). In this paper we consider the infinite analogues of circulant and random infinite circulant, and their connectivities and hamiltonian properties are discussed. Especially we answer a question of [4] in the case of infinite (undirected) circulants, and some results on random infinite circulants are also obtained. 展开更多
关键词 infinite circulant graph CONNECTIVITY
原文传递
Infinite Circulant Digraphs and Random Infinite Circulant Digraphs
3
作者 Qiang Xiang HUANG Ji Xiang MENG The College of Mathematics and Sciences. Xinjiang University. Urumqi 830046. P. R. China Fu Ji ZHANG The Department of Mathematics. Xiamen University. Xiamen 301005. P. R. China 《Acta Mathematica Sinica,English Series》 SCIE CSCD 2002年第4期817-822,共6页
In this paper, we completely determine the connectivity of every infinite circulant digraphs and prove that almost all infinite circulant digraphs are infinitely strongly connected and therefore have both one-and two-... In this paper, we completely determine the connectivity of every infinite circulant digraphs and prove that almost all infinite circulant digraphs are infinitely strongly connected and therefore have both one-and two-way infinite Hamiltonian paths. 展开更多
关键词 infinite circulant digraph CONNECTIVITY Hamiltonian path
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部