1) 2-connected simple graph
2连通简单图
2) 2-connected simple CD graph
2-连通简单CD图
3) simple connected graph
简单连通图
1.
Let G be a simple connected graph with n vertices and m edges.
若 G是一个有 n个顶点 m条边的简单连通图 。
4) 4-Edge connected simple graphs
4-线连通简单图
5) connected and weighted simple 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的最长圈的长至少为λ。
补充资料：简单
①结构单纯；头绪少；容易理解、使用或处理：情节～ㄧ～扼要 ㄧ这种机器比较～ㄧ他简简单单说了几句话。②（经历、能力等）平凡（多用于否定式）：李队长主意多，有魄力，可真不～。③草率；不细致：～从事。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条