助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   边图 在 数学 分类中 的翻译结果: 查询用时:1.657秒
图标索引 在分类学科中查询
所有学科
数学
计算机硬件技术
计算机软件及计算机应用
更多类别查询

图标索引 历史查询
 

边图
相关语句
  “边图”译为未确定词的双语例句
    Perturbation Problem of Eigenvalue of a Graph to Adding and Deleting an Edge(Ⅰ)
    加边与去边图的特征值的扰动问题(Ⅰ)
短句来源
    Perturbation Problem of Eigenvalue of a Graph to Adding and Deleting an Elge(Ⅱ)
    加边与去边图的特征值的扰动问题(Ⅱ)
短句来源
    DECOMPOSITIONS OFλΚv INTO THE GRAPHS WITH 7 POINTS, 7 EDGES AND AN EVEN-CIRCLE
    含偶长圈的7点7边图的图设计
短句来源
    A G-design with Six Vertices and Eight Edges
    关于一个六点八边图的图设计
短句来源
    Zhao studied the chromaticity of the family F of graphs with n+2 edges and n vertices. They first computed the chromatic polynomials of graphs in F and then divided this family into three subfamilies, F\, F2 and /^according to their chromatic polynomials and finally proved many results.
    Zhao研究了n点n+2边图族的色性,他们首次给出了F中图的色多项式,按照图的色多项式把n点n+2边图族F分成三个子族F_1、F_2、F_3,得到了关于F色性的许多重要结论。
短句来源
更多       
查询“边图”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  edge graph
Recurrence and transience of the edge graph of a tiling of the euclidean plane
      
The algorithms use characterizations of adjacent vertices in network and dual network LP's to perform an efficient traversal of the edge graph of the polyhedron.
      
Strong isoperimetric inequality for the edge graph of a tiling of the plane
      
We introduce a new kind of graph called "multi-edge graph" which arises in many applications such as finite state Markov chains and broadcasting communication networks.
      
We give two algorithms to partition a multi-edge graph into maximal clusters.
      
更多          
  line graph
Let G be a simple connected graph with n vertices and m edges, LG be the line graph of G and λ1 (LG) ≥ λ2 (LG) ≥ … ≥ λm (LG) be the eigenvalues of the graph LG.
      
In this paper, the range of eigenvalues of a line graph is considered.
      
But by using the concept of edge cochromatic number it is proved that if G is the line graph of a connected triangle-free graph with ω(G)>amp;lt;5 and G≠K4, then z(G)≥χ(G)-2.
      
It also allows for sensible definition of a line graph (the medial graph), particularly useful for domains consisting of connected channels, and not reliant on symmetries of the domains.
      
A special kind of embedding of graph into itsn-th iterated line graph, called incidence embedding, is studied.
      
更多          
  edge graph
Recurrence and transience of the edge graph of a tiling of the euclidean plane
      
The algorithms use characterizations of adjacent vertices in network and dual network LP's to perform an efficient traversal of the edge graph of the polyhedron.
      
Strong isoperimetric inequality for the edge graph of a tiling of the plane
      
We introduce a new kind of graph called "multi-edge graph" which arises in many applications such as finite state Markov chains and broadcasting communication networks.
      
We give two algorithms to partition a multi-edge graph into maximal clusters.
      
更多          


In this paper,the concept of the characteristic polynomial,the converse graph,the symmetrical closure and others are defined.The formulae for the number of loops,edges,triangles,pairs of two-way nodes and pairs of one-way nodes are deduced by the coefficients of a characteristic polynom- ial,so on.

本文引入有向图的特征多项式、反图、对称闭包等概念。初步探讨它们与图的某些整体性质的关系。推导出由特征多项式的系数表示的线图(无重边图)中圈的个数,双向结点对个数,单向结点对个数及简单图中有向三角形个数的计算公式,等等。

This paper discusses the following problem of reliable network synthesis: Given the number of nodes p , the number of edges q and edge failures ( or node failures) p, finding the graph with p nodes and q edges such that its reliability is largest within only having edge failures ( or node failures). A case of p=1/2 is only discussed here.

研究了以下网络可靠性综合问题:对给定的p和q,以及边失效率(或点失效率)p,构造具有p个点和q条边的图,使其在仅考虑边失效率(或点失效率)为p时,所成网络的可靠性最高。特别讨论了p=1/2的情况。

Bialostocki and Dierker raised the following interesting variant of the classical Ramse Theorem:Let G be a graph having m edges and let k≥2 be an integer such that k|m, and let Z_4 be the cyclic group of order k. Define R(G,Z,) to be the minimal integer t such that for every Z_4—coloring of the edges of K,, i.e. , a function c: E(K_4)→Z_k, there is in K_i a copy of G with the property that c(e)≡0(mod k).They proved that Zhao Dongfang and Gen Zhibin proved that R(C_3,Z_3)≥8.Zhao Dongfang proved that R(C_3,Z_3)≥9.In...

Bialostocki and Dierker raised the following interesting variant of the classical Ramse Theorem:Let G be a graph having m edges and let k≥2 be an integer such that k|m, and let Z_4 be the cyclic group of order k. Define R(G,Z,) to be the minimal integer t such that for every Z_4—coloring of the edges of K,, i.e. , a function c: E(K_4)→Z_k, there is in K_i a copy of G with the property that c(e)≡0(mod k).They proved that Zhao Dongfang and Gen Zhibin proved that R(C_3,Z_3)≥8.Zhao Dongfang proved that R(C_3,Z_3)≥9.In this paper, we proved that R(C_3,Z_3)≥11.

Bialostocki和Dierker给出了古典Ramaey定理下列有趣的推广:设G是一个有m条边的图,整数k≥2,且k|m,Z_k表示k阶循环群。定义R(G,Z_k)表示一个极小整数t,使得对K_t的边的任意Z_k—染色(即一个泛函C:E(K_t)→Z_k),K_t中都存在一个同构于G的子图具有下列性质 sum from e∈E(G) C(e)≡0(mod k)。本文证明R(C_3,Z_3)≥11。

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

 


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

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