助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   degree sequence 的翻译结果: 查询用时:0.216秒
图标索引 在分类学科中查询
所有学科
数学
建筑科学与工程
更多类别查询

图标索引 历史查询
 

degree sequence     
相关语句
  度序列
     And let V(P_m)={V_1,V_2,…V_(m-1),V_m} with corresponding degree sequence(1,2,…,2,1).
     设V(Pm)={V1,V2,…,Vm-1,Vm}及相应的度序列为(1,2,…,2,1)。
短句来源
     Let G be an arbitrary connected graph with p vertices and V(G) = {V1, V2,…, Vp}, and let Sn+1 be a star having degree sequence (n, 1,…, 1) with n + 1 vertices.
     设G是任意的p阶连通图,V(G)={V1,V2…,Vp},Sn+1是具有度序列(n,1,1,…,1)的n+1阶星图. 令(ψ)G(i)(n,p)表示图G的第i个顶点与Sn+1的n度点重迭后得到的图;
短句来源
     On Matching Uniqueness of Graphs With Degree Sequence(6~1,2~(n-1))
     关于度序列为(6~1,2~(p-1))的图的匹配唯一性
短句来源
     The tree having degree sequence (1,1,1,1,2,2…2,4) is called a tree of T-shape, let T_((1,1,m,n)) denote the Tree of T-shape,in which the lengths of the four paths from the only Vertex of degree 4 to four Vertices of degree 1 are 1,1, m , n respectively.
     T(1,1,m,n)表示度序列是(1,1,1,1,2,2…2,4)的树,其中1,1,m,n分别是从它的唯一4度点到4个1度点的4条路长;
短句来源
     A Tree having degree sequence (1,1,1,1,2,2,,
     把具有度序列是(1,1,1,1,2,2,…,2,4)的树称记为T(1,1,1,n),给出并证明了树T(1,1,1,n)的伴随多项式的计算公式
短句来源
更多       
  次序列
     THE DEGREE SEQUENCE OF HAMILTONIAN GRAPH OF NOT CONTAINING K~3
     不含K~3的哈密顿图的次序列
短句来源
     In this article We have proved that,if a simple graph G doesnot containing K~3 as a subgraph and its degree sequence is ■(?) in which r≥5,then G is hamiltonian.
     本文证明了:不含K~3的图类中,如果简单图G 的次序列是■■,其中r≥5,则G 是哈密顿图.
短句来源
     It can be proved by closure method that this degree sequence isHamiltonian, and it is not satisfy the condition of Chvatal.
     次序列是 Hamiltonian的,并且不满足Chvatal条件。
短句来源
     ON THE DEGREE SEQUENCE OF MAXIMAL OUTPLANAR GRAPHS
     关于极大外平面图的次序列
短句来源
  度序列的
     The recurrence construction method of the self-complementary graphs with 4n+1 vertices is given by diseussing the relations between the self-complementary graphs with 4n and 4n+1 vertices, and applying the degree sequence of self-complementary graphs.
     通过剖析4n阶和4n+1阶自补图之间的关系,应用度序列的方法,以4n阶自补图为基础,给出了构造4n+1阶自补图的递推方法。
短句来源
     We shall first study the connected graphs, and prove that a graph is connected if andonly if its degree sequence d = (d_1,d_2,...,d_n) satisfies the conditions:
     证明了正整数序列d=(d_1,d_2,…,d_n)是树的度序列的充要条件是sum from i=1 to n d_i=2(n-1)。
短句来源
     For sequence of nonnegative integer π=(d 1,d 2,…,d n),the necessary and sufficient condition and method of calculation in which π is degree sequence of 2-multigraph,which is given.
     对于给定的非负整数序列π =(d1,d2 ,… ,dn) ,给出π是 2—重图的度序列的充分必要条件及算法
短句来源
     The Largest Clique Number for Graphs Realizing the Same Degree Sequence
     实现同一度序列的图的最大团数(英文)
短句来源
     Secondly, according to the extended ideas which frequently used in the hypergraph research, by analyzing the relations of the hypertree with its isolated vertices, the research methods in graphic tree degree sequence of graph theory are applied to the narrowed hypertree and the generalized hypertree.
     其次,根据在研究超图的过程中常用到的推广延伸的思想,把图论中研究可树度序列的方法,通过分析超树与其孤立点总数之间的关系,推广应用到研究狭义超树和广义超树中。
短句来源
更多       
  “degree sequence”译为未确定词的双语例句
     A tree having degree sequence (1,1,1,2,2,…,2,3) is called a tree of T-shape.
     具有度序列(1,1,1,2,2,…,2,3)的树称为T形树。
短句来源
     The Matching Uniqueness of Graphs with Degree Sequence(4~1 ,2~(p-1))
     具有度序列(4~1,2~(p-1))图的匹配唯一性
短句来源
     On Mathcing Uniqueness of Graphs With Degree Sequence (8~1, 2~(p-1))
     具有度序列(8~1,2~(p-1))图的匹配唯一性
短句来源
     The tree having degree sequence (1, 1, 1, 2, 2, ..2. 3)is called a tree of T-shape.
     具有度序列(1,1,2,2,2,…,2,3)的树图称为T形树。
短句来源
     A graph G with n vertices v_1,v_2,…,v_n is said to be harmonic if the degree sequence(d(v_1),d(v_2),…,d(v_n))~T of G is an eigenvector of its adjacency matrix A,where d(v_i) is the degree of the vertex v_i,i=1,2,…,n.
     设v1,v2,…,vn是n阶图G的顶点,d(vi)表示顶点vi的度. 如果(d(v1),d(v2),…,d(vn))T是图G的邻接矩阵的一个特征向量,则说图G是调和的.
短句来源
更多       
查询“degree sequence”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  degree sequence
We consider a family of random graphs with a given expected degree sequence.
      
degree sequence of which the tail of the distribution function $$F$$ is regularly varying with exponent $$\tau\in [1,2]$$.
      
An integer sequence π is said to be graphic if it is the degree sequence of some simple graph G.
      
For an arbitrary graphic degree sequence d, we define min(ω,d) and max(ω,d) as follows: where is the graph of realizations of d.
      
We prove that if G runs over the set of graphs with a fixed degree sequence d, then the values ω(G) completely cover a line segment [a,b] of positive integers.
      
更多          


Bill Jackson gave a conjecture[1,conjecture 3[of 2—connected and“almost regular”graphs in the conference held in honour of professor W.T.Tutte on the occasion of his sixtieth birthday in July 5—9,1977.The Conjecture means that if G is a 2—connected graph on at most 3K+2 vertices with degree sequence(k,k,…,k,k+1, k+1),then G is hamiltonian.This paper presents two examples of 2—connected and“almost regular”graphs which are not hamiltonian,but they satisfy the condition of Jackson's conjecture.From the two...

Bill Jackson gave a conjecture[1,conjecture 3[of 2—connected and“almost regular”graphs in the conference held in honour of professor W.T.Tutte on the occasion of his sixtieth birthday in July 5—9,1977.The Conjecture means that if G is a 2—connected graph on at most 3K+2 vertices with degree sequence(k,k,…,k,k+1, k+1),then G is hamiltonian.This paper presents two examples of 2—connected and“almost regular”graphs which are not hamiltonian,but they satisfy the condition of Jackson's conjecture.From the two exa- mples,we may conclude that Jackson's conjecture does not hold。

本文给出两个反例,证明了 B·杰克逊在1977年提出的关于2—连通“几乎正则”图的杰克逊猜想是不成立的,同时指出了修改这个猜想是没有价值的。

Two classes of degree sequences of graphs which ensure these graphs to be hamiltonian are presented in [1], [2] extends the results of [1]. In this paper, a new class of degree sequences of graphs which ensure these graphs to be hamiltonian, and do not satisfy the condition of chvatal is presented.

文[1]提出了两类Hamilton次序列,文[2]推广了文[1]的结果,但其中每个次序列中不同元素的个数为2或3。本文提出一类Hamilton次序列,它不满足Chvatal条件,其中每个次序列中不同元素的个数为4。

In this article We have proved that,if a simple graph G doesnot containing K~3 as a subgraph and its degree sequence is ■(?)in which r≥5,then G is hamiltonian.

本文证明了:不含K~3的图类中,如果简单图G 的次序列是■■,其中r≥5,则G 是哈密顿图.

 
<< 更多相关文摘    
图标索引 相关查询

 


 
CNKI小工具
在英文学术搜索中查有关degree sequence的内容
在知识搜索中查有关degree sequence的内容
在数字搜索中查有关degree sequence的内容
在概念知识元中查有关degree sequence的内容
在学术趋势中查有关degree sequence的内容
 
 

CNKI主页设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
版权图标  2008 CNKI-中国知网
京ICP证040431号 互联网出版许可证 新出网证(京)字008号
北京市公安局海淀分局 备案号:110 1081725
版权图标 2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社