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

图标索引 历史查询
 

positive graph
相关语句
  正图
     if P n(A(G))≥0, for any n, then G is called path positive graph.
     若对任何n,Pn(A(G))≥0,则称G是道路正图
短句来源
     if Pn(A(G))≥0 for any n,then G is called the pathpositive graph.
     若对任何n,Pn(A(G))≥0,则称G是道路正图
短句来源
  相似匹配句对
     [s,t]-GRAPH
     [s,t]-图及其Hamilton性
短句来源
     Let G be a graph of order n and k any positive integer with k
     设G是一个顶点数为n的图,k为任意正整数且k≤n。
短句来源
     and positive familyhistory.
     x_9阳性家族史为智力低下的4个危险因素。
短句来源
     Has it positive action?
     能否发挥其积极作用?
短句来源
     For a graph G.
     对于图G.
短句来源
查询“positive graph”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  positive graph
In this paper, we prove that the set of all factorization indices of a completely positive graph has no gaps.
      


The path polynomial P k(λ), k≥1, is the characteristic polynomial of the tridiagonal matrix with 1′s on the super and subdiagonals and zeros elsewhere; and P 0(λ)≡1. The adjacency matrix of a connected graph is any unreduced and symmetrical (0,1) matrix. It is of combinational significance to calculate their path polynomials. Denote the adjacency matrix of a graph G by A(G); if P n(A(G))≥0, for any n, then G is called path positive graph. In this paper, we completely describe the structure formulas...

The path polynomial P k(λ), k≥1, is the characteristic polynomial of the tridiagonal matrix with 1′s on the super and subdiagonals and zeros elsewhere; and P 0(λ)≡1. The adjacency matrix of a connected graph is any unreduced and symmetrical (0,1) matrix. It is of combinational significance to calculate their path polynomials. Denote the adjacency matrix of a graph G by A(G); if P n(A(G))≥0, for any n, then G is called path positive graph. In this paper, we completely describe the structure formulas of path polynomials of trees H n for and k≥0 and n≥6; by the way, the tree H n, n 6, is path positive.

道路多项式Pk(λ)是上,下对角线元素是1,其它元素为0的k阶方阵的特征多项式,k≥1;记P0(λ)≡1。连通图的邻接矩阵是不可约的(0,1)一对称矩阵。这类矩阵的道路多项式的计算有重要的组合意义。图G的邻接矩阵记作A(G)。若对任何n,Pn(A(G))≥0,则称G是道路正图。该文给出了对任何k≥0,树Hn,n≥6的邻接矩阵A(Hn)的道路多项式Pk(A(Hn))的表达式。树Hn,n≥6,是道路正图。

The products of graphs discussed in this paper are the following four kinds: the Cartesian product of graphs, the tensor product of graphs, the lexicographic product of graphs and the strong direct product of graphs. It is proved that:① If the graphs G 1 and G 2 are the connected graphs, then the Cartesian product, the lexicographic product and the strong direct product in the products of graphs, are the path positive graphs. ② If the tensor product...

The products of graphs discussed in this paper are the following four kinds: the Cartesian product of graphs, the tensor product of graphs, the lexicographic product of graphs and the strong direct product of graphs. It is proved that:① If the graphs G 1 and G 2 are the connected graphs, then the Cartesian product, the lexicographic product and the strong direct product in the products of graphs, are the path positive graphs. ② If the tensor product is a path positive graph if and only if the graph G 1 and G 2 are the connected graphs, and the graph G 1 or G 2 has an odd cycle and max{ λ 1μ 1,λ nμ m}≥2 in which λ 1 and λ n [ or μ 1 and μ m] are maximum and minimum characteristic values of graph G 1 [ or G 2 ], respectively.

本文所讨论的积图是图的笛卡尔积,图的张量积,图的逻辑积和图的强直积四种积图.证明了:①如果G1和G2都是连通图,则积图中笛卡尔积,逻辑积和强直积都是道路正图.②图的张量积是道路正图的是图G1和G2是一个连通图,G1[或G2]有一个奇圈,且max{λ1μ1,λnμm}≥2,其中λ1和λn[或μ1和μm]分别是图G1或G2的最大和最小特征值

The pathpolynomial Pk(λ),k≥1,is the characteristic polynomial of the tridiagonal matrix with 1′s on the super and subdiagonals and zeros elsewhere;and P0(λ)=1.The adjacency matrix of a connected graph is any unreduced and symmetrical (0,1)matrix.It is of combinational significance to calculate their pathpolynomials.The adjacency matrix of a graph G is denoted by A(G);if Pn(A(G))≥0 for any n,then G is called the pathpositive graph.In this paper,we completely describe the strucure formulas...

The pathpolynomial Pk(λ),k≥1,is the characteristic polynomial of the tridiagonal matrix with 1′s on the super and subdiagonals and zeros elsewhere;and P0(λ)=1.The adjacency matrix of a connected graph is any unreduced and symmetrical (0,1)matrix.It is of combinational significance to calculate their pathpolynomials.The adjacency matrix of a graph G is denoted by A(G);if Pn(A(G))≥0 for any n,then G is called the pathpositive graph.In this paper,we completely describe the strucure formulas for pathpolynomials of stars Sn for any k≥0 and n≥5,with the stars Sn,n≥5,being pathpositive.

道路多项式Pk(λ)是上、下对角线元素是1,其它元素为0的k阶方阵的特征多项式(k≥1);记P0(λ)=1。连通图的邻接矩阵是不可约的(0,1)—对称矩阵,称这类矩阵的特征多项式为其道路多项式。这类道路多项式的计算有重要的组合意义。图G的邻接矩阵记作A(G)。若对任何n,Pn(A(G))≥0,则称G是道路正图。本文给出了对任何k≥0,星Sn(n≥5)的邻接矩阵A(Sn)的道路多项式Pk(A(Sn))的表达式。星Sn(n≥5),是道路正图。

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

 


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

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