1) S-θcurve
S-θ图
2) θ-Graph
θ-图
1.
On Adjacent Vertex-distinguishing Total Coloring of θ-Graph;
关于θ-图的邻点可区别全染色
2.
The θ-graph is a 2-connected simple graph consisting of 3 internally disjoint paths between a pair of vertices of degree 3.
u,v两点间连三条内部不相交的路且至多有一条长度为 1的图 ,称为θ-图 。
3.
Second,on the basis of the path and cycle,the game chromatic numbers of θ-graph and general θ-graph are obtained respectively,and the winning strategy for A player is presented.
在路图和图圈的基础上,利用顶点标号的方法,分别对θ-图和广义θ-图分情况进行了讨论,并得出了它们的对策色数Ⅱ。
3) θgraph
θ图
1.
In this article, the anthor study the existence of graph design of non-isomorphic simpledirectedθgraphs with six vertices, and eight non-isomorphic simple directedθgraphswith se.
本文研究了六点有向θ图和七点有向θ图的图设计的存在性问题。
4) θ-S~*-Compact set
θ-S~*-紧集
5) s-θ-completion
s-θ-完备
1.
The s-θ-completions of Maximal Subgroups and the Solvability of Finite Groups
极大子群的s-θ-完备与有限群的可解性
2.
On the s-θ-completions of maximal subgroups and the π-solvability of a finite group
有限群极大子群的s-θ-完备与π-可解性
6) LF S-θ-connectedness
S-θ连通性
补充资料：图的减缩图(或称图子式)
图的减缩图(或称图子式)
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
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条