1) fractional vertex linear arboricity
![点击朗读](/dictall/images/read.gif)
分数点线性荫度
2) vertex linear arboricity
![点击朗读](/dictall/images/read.gif)
点线性荫度
1.
The vertex linear arboricity of the integer distance graph;
![点击朗读](/dictall/images/read.gif)
整数距离图G(D_(m,3))的点线性荫度
2.
The vertex linear arboricity of the integer distance graph G(D_(m,2));
![点击朗读](/dictall/images/read.gif)
整数距离图G(D_(m,2))的点线性荫度
3.
Here the vertex linear arboricity of integer distance graph G(D)(denoted by vla(G(D)))is studied.
本文讨论整数距离图的点线性荫度,记为vla(G(D))。
3) the vertex linear arboricity
![点击朗读](/dictall/images/read.gif)
线性点荫度
1.
In the paper, we determined the vertex linear arboricity of complete multiple graphs and provided an upper bound for the vertex linear arboricity of Cartesian product graphs.
图的线性点荫度是对它的顶点进行染色所用的最少颜色数,同时使得染同一种颜色的点集所导出的子图,它的每个分支均为路。
4) rertex linear arboricity
![点击朗读](/dictall/images/read.gif)
点线荫度
5) linear arboricity
![点击朗读](/dictall/images/read.gif)
线性荫度
1.
The relationship between the maximum average degree and the linear arboricity of a graph;
![点击朗读](/dictall/images/read.gif)
图的最大平均度与线性荫度的关系
2.
It is proved here that a connected graph G has the linear arboricity la(G)=「Δ/2 if |E||V|+「3Δ/2-4.
设G是一个连通图且满足|E||V|+「3Δ/2-4,则它的线性荫度la(G)=「Δ/2。
3.
In the paper, we prove that if G is a Halin graph, then the linear arboricity of Gis 「△(G)/2,the vertex arboricity and the vertex linear arboricity of G is 2, the path decomposition number of G is half of the number of vertices of odd degree.
本文证明了:若G是Halin图,则G的线性荫度为[△(G)/2],点荫度和线性点荫度为2,路分解数等于它的奇数度顶点的一半。
6) linear 2-arboricity
![点击朗读](/dictall/images/read.gif)
线性2-荫度
1.
The linear 2-arboricity of planar graphs without 4-cycles;
![点击朗读](/dictall/images/read.gif)
不含4-圈的平面图的线性2-荫度
2.
The linear 2-arboricity la_2(G) of a graph G is the least integer k such that G can be partitioned into k edge-disjoint forests,whose component trees are paths of length at most 2.
图G的线性2-荫度la_2(G)是将G分解为k个边不交的森林的最小整数k,其中每个森林的分支树是长度至多为2的路。
3.
In this thesis, we study the linear arboricity and the linear 2-arboricity of graphs.
![点击朗读](/dictall/images/read.gif)
以图的染色理论和因子分解理论作为应用背景,本硕士论文研究了图的线性荫度及线性2-荫度问题。
补充资料:连分数的渐近分数
连分数的渐近分数
convergent of a continued fraction
连分数的渐近分数l阴ve吧e时ofa阴‘毗d五,比.;n侧卫xp口.坦”八卯6‘] 见连分数(con tinued fraction).
说明:补充资料仅用于学习参考,请勿用于其它任何用途。
参考词条