助手标题
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
共[16]条 当前为第1条到16条
 

相关语句
未完全匹配句对
    The Designs of Three Kinds of Graphs with Six Points and Seven Edges
    关于三类六点七边图的图设计
    Perturbation Problem of Eigenvalue of a Graph to Adding and Deleting an Edge(Ⅰ)
    加边与去边图的特征值的扰动问题(Ⅰ)
    The Design Method of a Graph with Six Vertices and Seven Edges
    一个六点七边图的特殊图设计构造
    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边图的图设计
    The Design Method of a Graph with Six Points and Seven Edges
    一个特殊六点七边图的图设计
    The design of the graphs with six points and seven edges
    六点七边图的图设计
    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色性的许多重要结论。
    ? ? 17, and we almost solve the existence problems of G-design for the remaining fourteen graphs except for G16 and
    本文讨论了其余14个六点八边图的图设计存在问题,除了第16和17个图外基本解决了另外12个图的图设计存在性问题。
    Alspach and Zhang[2] proved that the graphs which do not contain a subdivision of the Petersen graph satisfy cycle double cover conjecture.
    Alspach和Zhang[2]证明了所有不含Petersen图的剖分子图的无割边图满足圈双覆盖猜想。
    In 1987, the well-know mathematician Yousef Alavi and other famous mathematicians defined a new decomposition of graph-Ascending Subgraph Decomposition (ASD) which is on the condition of proper subgraph isomorphic, and in the same paper they proposed the following ASD conjecture (Alavi conjecture): every graph of positive size has an ASD.
    升分解(ascending subgraph decomposition,简记为ASD)是1987年闻名世界的数学家Alavi与其他几位著名数学家给出的一种在真子图同构意义下的图的新分解,并且在同一论文中他们还提出了一个升分解猜想(Alavi猜想):任意有正数条边的图都可升分解。
    For n ≥ 7, we proved that the extremal graph with minimal degree distance in P~+(n,m) is a follower F(n,m) which is m triangles sharing a common vertex on which n - 1 - 2m pendent edges attached .
    我们证明了当n≥7时,P~+(n,m)中具有最小度距离的图是花F(n,m),它是m个具有一个公共顶点的三角形并在公共顶点粘上n-1-2m条悬挂边的图;
    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.
    Bialostocki和Dierker给出了古典Ramaey定理下列有趣的推广:设G是一个有m条边的图,整数k≥2,且k|m,Z_k表示k阶循环群。
    For given integers v,e and λ, let f(v,e,λ)=max{P(G,λ): G is a gragh with v vertices and e edges}. In this paper. we obtain a new upper bound for f(v,e,λ) and new lower bounds for f(v,e,3).
    设P(G,λ)表示图G的色多项式.给定正整数n,e和λ,记f(v,e,λ)=max{P(G,λ):G是个v点e边的图}.本文得到f(v,e,λ)的新上界和f(v,e,3)的新下界.
    The covering number C(ν. G)is the minimum number of edge-disjoint subgraphs isomorphic to a given graph G inKv In this paper, P(ν. G) and C(ν, G) are determined bilsically for integers ν≥5 with five vertices and four edges.
    正整数P(ν,G)和C(ν,G)分别称为Kν的G—填充数和G—覆盖教。 对5个顶点、4条边的图G,基本确定了P(ν,G)和C(ν,G)值。
 

首页上一页1下一页尾页 

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