1) Quasi Hamilton bipartite oriented graph
Quasi-Hamilton有向偶图
2) hamiltonian digraphs
Hamilton有向图
1.
In this paper,it is proved that for a digraph D of order n≥7,if d(x)+d(y)≥(5n)/2-5 for every pair of non-adjacent vertices x,y with a common out-neighbor or a common in-neighbor,then D is hamiltonian and for 3≤n≤6,there are non-hamiltonian digraphs satisfying that d(x)+d(y)≥(5n)/2-5 for every pai.
猜想:如果D中每一对不相邻且有公共外邻或公共内邻的顶点x,y都有d(x)+d(y)≥2n-1,那么D是Hamilton有向图。
3) directed Hamil-tonian cycle
有向Hamilton图
4) Directed bipartite graph
有向偶图
5) directed hamilton cycle
Hamilton有向圈
6) quasi-Deza graph
quasi-Deza图
1.
Γ~1(M) is a quasi-Deza graph with the union of (?) isomorphic connected components.
Γ~((1))(M)是quasi-Deza图,它是(?)个互相同构的连通分支的并,而每个分支是顶点数为q~(2n-4m+1),价为q~(n-2m-1)(q~(n-2m+2)-q~(n-2m)+(-1)~(n-2m)),直径为2的quasi-Deza图。
补充资料：图的减缩图(或称图子式)
图的减缩图(或称图子式)
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
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条