2) spanning bipartite subgraph
生成偶子图
1.
In this paper,by the way of spanning bipartite subgraphs,it is showed that:let G be a simple graph with chromatic number k≥1.
利用生成偶子图证明了:当k为偶数时,ρ(G)≤k-1/kμ(G);当k为奇数时,ρ(G)≤k/k+1μ(G)。
3) dual bi-chromatic subgraph
对偶二色子图
1.
Then we prove the one-to-one corresponding relation between 3-coloring of inducing four regular graph and 4-coloring of maximal planar graph and find out the relation between three colors of inducing four regular graph and three dual bi-chromatic subgraph of maximal planar graph.
本文给出了极大平面图的导出四正则图的两种构造方式、等价性及性质,证明了导出四正则图的三着色与原极大平面图四着色的一一对应关系,并且找出了导出四正则图的三种颜色与原极大平面图四着色的三组对偶二色子图之间的关系。
4) Dual bi￣tri chromatic Subgraph
对偶2-3色子图
5) bipartite graph
偶图
1.
Uniqueness of cycle length distribution of bipartite graphs;
偶图K_(n,n)-A(|A|=6)圈长分布的唯一性
6) bigraph
['baiɡrɑ:f]
偶图
1.
Taking the supplying regions as rows of the bigraph, the optimum scheme for looped grids feeder arrangement with minimum cost is obtained by a minimum weight match algorithm of bigraph.
以联络线的建设费用最小为目标函数,将各供电分区作为偶图的2列,采用最小权匹配算法得到"手拉手"环状网的最优配对结果。
2.
This paper presents all the connected simple bigraphs whose energy does not exceed 4,and an inequality about the energy of a graph and the number of the edges of the graph.
本文给出所有能级不超过 4的连通偶图 ,并给出关于图的能级与其边的个数的一个不等式 。
3.
The DM-decomposition algorithm is an automated geometric deduction method based on the DM- decomposition of bigraphs.
几何自动推理的DM-分解算法是一个基于偶图DM-分解的几何自动推理方法。
补充资料：图的减缩图(或称图子式)
图的减缩图(或称图子式)
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
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条