一般图 general graph(7) general graphs(11)   general graph      And we consider the special case of b′\-w(G), that b′\-w(G) is equal to 1, we call G is edge-removal-critical(ER-critical). Then give necessary and sufficient condition for regular graphs to be γ\-w-ER-critical and necessary condition for general graph to be γ\-w-ER-critical.      称b′w(G)=1图为弱控制去边临界图,简记为γw-ER-critical,本文研究了正则图是弱控制去边临界图的充要条件,以及一般图的必要条件. 短句来源      An approach to approximate querying of general graph structured semistructured data is proposed based on a relational database system.      提出一种利用关系数据库系统在一般图结构的半结构化数据上进行近似查询的途径. 短句来源      The NP-completeness of fill-in problem on general graph is proved by literature[12-14].      一般图的填充问题被证明为NP-完全的。 因而对一般图的填充问题不可能有好算法。 短句来源      The architecture is represented by a bipartite graph and its relation with a general graph is also discussed.      文中用两类节点的二分图表示所提出的网络结构,并讨论了其与一般图表示方法问的关系. 短句来源      Sufficient and necessary conditions for coverings and deletions of parity ( g,f )_factors of a general graph are given, and their duality is investigated.      给出一般图的奇偶 (g ,f)_因子覆盖和消去的充要条件 ,并研究其对偶性 短句来源 更多          general graphs      In Chaper 2, we present lower and upper bounds on λ_e interms of the maximum degree for general graphs, and show that λ(L(G)) ≤ [(Δ_L~2)/2 +2Δ_L-1] ≤ Δ_L~2, which implies that all line graphs are consistent with the conjecture of Griggs and Yen.      在第二章中，我们给出一般图其边标号数λ_e关于最大度的上下界，得到λ(L(G))≤[Δ_L~2/2+2Δ_L-1]≤Δ_L~2，从而证明了Griggs和Yeh的猜想对所有线图都成立。 短句来源      For general graphs G1 and G2,a sharp lower bound and a sharp upper bound of the decycling number of box-cross product graph G1■G2 are given.      对于一般图G1和G2,得到了它们的盒叉积G1■G2的消圈数的一个紧的上界和一个紧的下界. 短句来源      Give the definition of the fissile graph, extend the L(d,1)-labeling of graphs to the L(0,1,2d,d,1)-labeling of weighted graphs, and give an upper bound of the L(0,1,2d,d,1)-labeling number of the fissile graphs for the general graphs and two classes of planar graphs and their correlative graphs.      引入裂变图的概念 ,将图的L(d ,1) -标号推广到赋权图的L(0 ,1,2d ,d ,1) -标号 ,给出了一般图的裂变图的L(0 ,1,2d ,d ,1) -标号数的一个上界 ,并分别给出了两类平面图及相关图的裂变图L(0 ,1,2d ,d ,1) 标号数一个上界 . 短句来源      It is known that the problem is APX-hard for general graphs and NP-hard for planar graphs.      此问题在一般图下是APX困难问题 ,在平面图下是NP困难问题 . 短句来源      The first chapter introduces the basic concepts of general graphs, traditional hypergraphs and information hypergraphs, as well as the research development of graph labeling, cycle decomposition of traditional hypergraphs and information hypergraph.      第一章简要介绍了一般图、传统超图和信息超图的基本概念,以及图标号、传统超图和信息超图的圈分解问题研究的基本情况. 短句来源 更多          “一般图”译为未确定词的双语例句      we then derive λ 3(G)≤3 maxHGδ(H)(Δ2-Δ+1) for any graph G with maximum degree Δ;      然后根据 χ3 (G)与λ3 (G)的关系 ,得出了对一般图G ,有λ3 (G) ≤ 3maxH Gδ(H) (Δ2 -Δ+ 1 )这一一般关系式 ; 短句来源      finally,the upper bounds of L(d_1,d_2)-labelings of general and planar graphs are given.      最后得出了一般图与平面图的λ_(d_1,d_2)(G)的上界。 短句来源      The well-known conjecture that λ(G)≤Δ~2 for selfcomplementary graphs has been verified.      验证了关于一般图的L(2,1)-标号数的猜想λ(G)≤Δ2对于自补图的正确性。 短句来源      It is known that λ_d(G)≤Δ~2+(d-1)Δ for any graph G with maximum degree Δ.      图G的L(d,1)标号数λd(G)是指最小的正整数k使得G有一个L(d,1)标号f满足f(V){0,1,2,…,k}。 已知对于最大度为Δ的一般图有λd(G)≤Δ2+(d-1)Δ。 短句来源      Nevertheless,the research of this paper shows that many adhesive graphs S3⊙G are the finite niche graphs.       但是本文通过星S3与几个简单图类之粘接图的niche数以及星与一般图之粘接图的niche数等问题的研究表明:许多粘接图S3⊙G都是有限niche图. 短句来源 更多        查询“一般图”译词为用户自定义的双语例句     我想查看译文中含有：的双语例句 为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法，我们为您准备了出自英文原文的大量英语例句，供您参考。   general graph We propose here a generalization of this approach to generate a general graph, as a candidate for modeling the Internet. 例句来源       It is known(5) that an investigation of the up-embeddability of the 3-regular graphs shows a useful approach to that of the general graph. 例句来源       We present a new algorithm for finding a maximum matching in a general graph. 例句来源       We prove that the time complexity to solve this routing problem over general graph networks is NP-complete, and then propose a routing algorithm for overlay networks to minimize server load. 例句来源       These inequalities describe a subclass of facets for the K-median problem on a general graph. 例句来源       更多             general graphs It is known that the problem for general graphs is NP-hard while it is polynomially solvable for trees. 例句来源       Hence metamathematical results for trees carry over to more general graphs. 例句来源       We present bounds of γ(G), discuss algorithms to find this quantity for trees and general graphs, and report computational experience. 例句来源       It is well known that coloring problems on general graphs are hard to approximate. 例句来源       We provide the basic framework for quantum hitting time and give two alternative definitions to set the ground for its study on general graphs. 例句来源       更多                    This paper looks bricfly at the way how to deal with the problem of the travel time from the facility to areas within the graph(that is, collections of points as opposed to individual points). As am extension of the results in[4], we generalize the problem by permitting an optimal point (to he) laid either on an edge or on a vertex of the graph instead of only on a vertex. The cancept of absolute S-center and S-median of a graph G is introduced as follows:             本文把只能在图的顶点上选取最优位置的面服务型选址问题推广为可以在整个图上选取最优位置的面服务型选址问题;提出了绝对S-中心和绝对S-中点的概念。本文讨论了S-中心,S-中点与绝对S-中心和绝对S-中点的关系,并分别给出了在树和一般图上寻找绝对S-中心的算法。 文摘来源          Hoasoya's index is an important index indicating the properties of physics and chemistry of an organic structure in molecular topology, The graphs with single cyele represent a kind of compounds with a single ring. In this.paper, couut formulae of Hosoya's indcx for this type of graphs are given as well as two theorems of Hosoya's index for general graphs.             非邻接数(又称Hosoya' slndex)是分子拓扑学中表征有机结构的理化性质的一个重要指数,单圈图代表比较广泛的一类单环化合物。本文给出了这种图的非邻接数的计算公式,还给出了一般图的非邻接数的两个定理。 文摘来源          This paper gives the numerical relation between the connected degree and the edge - connected degree for a kind of special graphs - k, the             本文对一类特殊图——k—正则图给出了连通度与边连通度之间的定量关系:K＇≤[k/2]K。并通过证明过程把这种关系又进一步推广到更为一般的图类上去.对一个简单图G,若存在K个其度不超过k的顶点构成图G的一个点割集,则也有关系式K＇≤[k/2]K成立.由此,对任意一个简单图G,都有关系式K＇≤[△/2]K成立,从而文献[1]中的习题3.1.6(若G是3—正则简单图,则K=K＇)便成为本文的一个自然推论. 文摘来源   << 更多相关文摘         相关查询: 一般基本图 一般 （图 —图 (图 图 一般线性聚亚苯基图m 结合性图 电缆图 接受图 笔划图 白色图  对查询结果不满意

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

CNKI主页 |  设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务

2008 CNKI－中国知网

京ICP证040431号 互联网出版许可证 新出网证(京)字008号 北京市公安局海淀分局 备案号：110 1081725  2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社