1) connected graph
连通图
1.
An Algorithm of Constructing a Connected Graph from a Connectible Sequence;
可连通图序列的一个连通图实现的构造算法
2.
On the relation between the circumference of a connected graph and the coefficient of its color palymonial;
连通图的周长与它的色多项式系数的关系
3.
New sufficient condition for making connected graphs be traceable
连通图可迹的新充分条件
2) connected graphs
连通图
1.
Using some properties of matrix,a sharp upper bound on the quasi-Laplacian spectral radius of connected graphs is obtained,and the superiority of the upper bound is compared with other bounds through some graphs.
对于连通图G,矩阵Q(G)=D(G)+A(G)称为图G的拟拉普拉斯矩阵,其中D(G)为图的度对角矩阵,A(G)为图的邻接矩阵。
2.
Let G(V,E) be simple graph,Ore studied Hamilton connected graphs with any nonadjacent two vertices.
令 G(V,E)是简单图 ,Ore研究了不相邻两点情况的哈密尔顿连通图。
3.
Connected graphs play an important role in practical applications because of its close connection with network model and combinatorial optimization.
连通图与网络模型和组合优化联系密切,使它具备很强的应用背景。
3) unconnected graph
非连通图
1.
The researches on gracefilness of two kinds of unconnected graphs;
两类非连通图优美性的研究(英文)
2.
This paper discusses the gracefulness of unconnected graphes, presents a kind of unconnected graph C 3∪F m,4 , and proves its gracefulness.
本文对非连通图的优美性进行探讨 ,并给出一类非连通图C3∪Fm ,4 ,且证明了这类非连通图是优美
4) panconnected graph
泛连通图
5) 2-connected graph
2-连通图
1.
Let G=(V;E) be a 2-connected graph of order n and k a positive integer, we consider the problem of partitioning G into k vertexdisjoint paths under the neighborhood union condition and them obtain the new following results: If ｜N_G(x_1)∪N_G(x_2)｜+｜N_G(y_1)∪N_G(y_2)｜n-k for every four independent vertices, then G can be partitioned into k vertex-disjoint paths.
给定一个阶为n的2-连通图G=(V;E)及一个正整数k,考虑在邻域并条件下G被分成k条点不交路的问题,得到下面的结果,对G中任何四个独立点x1,x2,y1,y2∈V,满足|NG(x1)∪NG(x2)|+|NG(y1)∪NG(y2)|n-k,则G能被分划分k条点不交的路。
2.
Any 2-connected graph on n vertices such that the degree sum of any two vertices at distance 2 is at least λ—1 contains a cycle of length at least λ.
若G是2-连通图,如对G中任何两个距离为2的点υ,ν都有d(υ)+d(ν)≥λ-1(5≤λ≤|V(G)|),则除了两类图外,G的最长圈的长至少为λ。
6) connectivity of graph
图连通性
补充资料：单连通和多（复）连通超导体（simplyandmultiplyconnectedsuperconductors）
单连通和多（复）连通超导体（simplyandmultiplyconnectedsuperconductors）
单连通超导体一般指的是不包含有非超导绝缘物质或空腔贯通的整块同质超导体，若有非超导绝缘物质或空腔贯通的超导体则称为多（复）连通超导体。从几何学上讲，在超导体外表面所包围的体积内任取一曲线回路，这回路在超导物质内可收缩到零（或点），且所取的任意回路均可收缩到零而无例外，则称单连通超导体。若有例外，即不能收缩到零，则称多连通超导体。例如空心超导圆柱体，则在围绕柱空腔周围取一回路就不能收缩为零。多连通超导体可有磁通量子化现象（见“磁通量子化”）。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条