- 更多网络例句与传递图相关的网络例句 [注：此内容来源于网络，仅供参考]
-
In fact, researching the symmetry property of the Coset graph is more significant than the Cayleygraph, because every vertex-transitive graph is always some Coset graph of its full automorphism group.
关于陪集图对称性的研究其实较Cayley图更具有普遍的意义，因为任何一个点传递图都是其全自同构群的某个陪集图。
-
In fact, researching the symmetry of Sabidussi coset graphs has more general significance than doing so for the Cayley graph because every vertex-transitive graph is always some coset graph of its full automorphism group.
关于陪集图对称性的研究其实较Cayley图更具有普遍的意义，因为任何一个点传递图都是其全自同构群的某个陪集图。
-
The following results are obtained: Let G be a connected point-transitive graph.
得到以下结果：设G是一个连通的顶点可传递图。
-
B Let G be a connected point-transitive graph.
b设G是一个连通的顶点可传递图。
-
There are two parts in this paper:In the first part, the s -arc transitive problem of odd graph K_(2r+1,r) is investigated.
Godsil等证明了每一个奇图K_(2r+1，r)至少是2-弧传递图，那么自然提出问题： K_(2r+1 ，r)是s-弧传递的s的最大值是多少？
-
In chapter 4, we studythe cyclic edge connectedness of regular half vertex transitive graphs, we showthat a connected k(≥4)-regular half vertex transitive graph X with girthg≥6 isλ_c-optimal, and we also obtain a su?cient and necessary conditionfor a connected k(≥4)-regular half vertex transitive graph X with girth 4 tobeλ_c-optimal.
第四章，我们研究了正则半点传递图的圈边连通性问题，主要结果是证明了一个围长为g≥6的k(≥4)-正则连通半点传递图X是λ_c-最优的，并且得到了一个围长为g = 4的k(≥4)-正则连通半点传递图X是λ_c-最优的充分必要条件。
-
A graph F is said to be semisymmetric if it is regular and Aut acts transitively on its edge set but not on its vertex set.
称X为边传递图，如果Aut_E在E上是传递置换群，边传递而点不传递的正则图叫做半对称图。
-
As a corollary ,we prove the nonexistance of cubic semisymmetric graph of order 12p,i.e.,for all edge-transitive cubic graph of 12p is symmetric.
本文通过对12p阶3度边传递图的全自同构群的研究，证明了12p阶3度半对称图不存在，即任意12p阶边传递图必为对称图。
-
In the special case when G = AutX, we call a G—vertex-transtive graph, G—edge-transtive graph, G—semisymmetric graph X is vertex-transtive edge-transtive semisymmetric graph respectively In this paper we investigate the autmorphism graph AutX of the cubic semisymmetric graph of order 12p ,when p is primes.
特别地，若G=AutX这时的G-点传递图、G-边传递图、G-半对称图称为点传递图边传递图半对称图。
-
In the subcase that K is doubly transitive on every block B〓, there is exactly one non-primitive connected arc-transitive graph on Z〓×Z〓p.
设Γ=Cay是G=Z〓×Z〓上的非本原连通弧传递图，B={B〓，B〓，…，B〓}是A=Aut在V=G上的非平凡完全块系，而K是A=Aut在B上作用的核。
- 更多网络解释与传递图相关的网络解释 [注：此内容来源于网络，仅供参考]
-
Bar graph：条形图
观察图表是为了准确理解图表所传递的信息. 考生首先要认清图表的形式,抓住其特点. 统计图表一般有两种形式,一种是把统计的数字和被说明的事物直接用表格的形式表现出来,这就是统计表(table). 另一种形式是统计图(graph)如曲线图(line graph),条形图(bar graph)和扇形图(pie graph)等
-
transitive group of motions：可迁运动群
transitive graph 传递图 | transitive group of motions 可迁运动群 | transitive law 可迁律
-
high fidelity transfer：高保真度图象传递
high fidelity 高真实性 | high fidelity transfer 高保真度图象传递 | high frequency amplifier 高频放大器
-
neurite：突起
神经细胞之基本构造,可分为细胞本体 (soma) 与突起 (neurite). 而突起又分为负责接收讯息至神经细胞的树突 (dendrite) 和负责将讯息传递出去的轴突 (axon). 两神经细胞交界面彼此藉由电讯号及化学分子传递於突触 (synapse) (图 9) 以形成功能性神经网路.
-
transitive graph：传递图
transitive closure 传递闭包 | transitive graph 传递图 | transitive group of motions 可迁运动群
-
transitive graph：可迁图
transitive digraph 可迁有相图 | transitive graph 可迁图 | transitive relation 传递关系
-
distance transitive graph：距离传递图
拒绝区域|rejection region | 距离传递图|distance transitive graph | 距离结构|distance structure
-
weakly 1-arc transitive graph：弱1-弧传递图
推理题:Inference Question | 弱1-弧传递图:weakly 1-arc transitive graph | 二价及物动词:two-valence transitive verb
-
ROG Rheoophthalmography：眼血流图描记法
RODEO Rotating Delivery of Excitation Off Resonance 激发去共振的旋转传递技术 | ROG Rheoophthalmography 眼血流图描记法 | ROI Region of Interest 感兴趣区
-
two-valence transitive verb：二价及物动词
弱1-弧传递图:weakly 1-arc transitive graph | 二价及物动词:two-valence transitive verb | 传递闭包法:transitive closure method