1) k-connected graphs
κ-连通图
2) minimally k-connected graph
极小κ-连通图
3) 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
连通图可迹的新充分条件
4) 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 ,且证明了这类非连通图是优美
5) panconnected graph
泛连通图
6) 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的最长圈的长至少为λ。
补充资料：三丁氧基(2,4-戊二酮根合-κO,κO')-锆
CAS：85626-36-4
中文名称：三丁氧基(2,4-戊二酮根合-κO,κO')-锆
英文名称：tributoxy(2, 4-pentanedionato-.kappa.O, .kappa.O')-Zirconium； Zirconium,tributoxy(2,4-pentanedionato-.kappa.O,.kappa.O')-
中文名称：三丁氧基(2,4-戊二酮根合-κO,κO')-锆
英文名称：tributoxy(2, 4-pentanedionato-.kappa.O, .kappa.O')-Zirconium； Zirconium,tributoxy(2,4-pentanedionato-.kappa.O,.kappa.O')-
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条