1) the square of graphs
图的平方
1.
The mean distance of composite graphs and the square of graphs are researched,and some result of special composite graphs is obtained.
确定了复合图及一些图的平方的平均距离 ,并给出了一些特殊图的复合结
2) Vertex Arboricity of Square Graphs
平方图的点荫度
3) Coloring the Square of Graphs
平方图的染色
4) the bound of the sum of the squares of the degrees in a graph
图中度平方和的界
5) square
[英][skweə(r)] [美][skwɛr]
平方图
1.
In this paper,we prove that δ(G~2)≤Δ(G)+33,where G~2,δ(G) and Δ(G) denote the square,the minimum degree and the maximum degree of G,respectively.
证明了δ(G2)≤Δ(G)+17,其中G2、δ(G)和Δ(G)分别记作图G的平方图、最小度和最大度。
2.
The square G2 of G is the graph defined on the vertex set V(G) such that two vertices u and v are adjacent in G2 if and only if they are at distance 1 or 2 in G.
设G是一个没有4-圈的平面图,G的平方图G2定义在V(G)上,使得2个点u和v在G2中是相邻的当且仅当它们在G中的距离为1或2。
3.
The square of a graph G, denoted by G~2, is a graph with the same vertex set such that two vertices are adjacent in G~2 iff their distance is at most 2 in G.
图G的平方图 ,记作G2 ,是一个以原图的顶点集为顶点集 ,若原图中两点的距离不大于 2则连以边所成的图 。
6) square graph
平方图
1.
Hamiltonicity,neighborhood union and square graphs of claw-free graphs;
哈密尔顿性、邻域并和无爪图的平方图(英文)
2.
The square graph G~2 of agraph G is the graph defined on the vertex set V(G) such that two vertices are adjacent in G~2 if and only if the distance between them is at most 2.
图G的平方图G2是以V(G)作为它的点集,两个点在G2中相邻当且仅当它们在G中的距离至多为2。
补充资料：图的减缩图(或称图子式)
图的减缩图(或称图子式)
minor of a graph
图的减缩图(或称图子式)【.皿以ofa脚户;MHHoPrpa中a」【补注】设G是一个图(graph)(可以有环及多重边).G的一个减缩图(nullor)是从G中接连进行下述运算而得的任何一个图: i)删去一条边; 五)收缩一条边; 说)去掉一个孤立顶点. NRobe由on与P.D.Se脚aour的图减缩定理(脚Ph nl的。r theon习11)如下所述:已知有限图的无穷序列G，，GZ，…，则存在指标i
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条