说明:双击或选中下面任意单词,将显示该词的音标、读音、翻译等;选中中文或多个词,将显示翻译。
您的位置:首页 -> 词典 -> 几乎一样
1)  Much the same.
几乎一样
2)  as good as
和……几乎一样
3)  He is little better than a thief.
他几乎和贼一样。
4)  much the same as yesterday
几乎与昨天一样
5)  almost uniquely pancyclic graphs
几乎唯一泛圈图
1.
If there exists m(3≤m<n) such that G contains exactly one cycle of length l for every l∈{3,4,… , n} - {m} and contains no cycle of length m, then G is called almost uniquely pancyclic graphs.
设G是阶为n的简单Hamilton图,若存在m(3≤m<n)使对每个l∈{3,4,…,n}-{m},G恰有一个长为l的圈且不含长为m的圈,则称G是几乎唯一泛圈图。
6)  almost uniquely pancyclic graph
几乎唯一泛圈图
1.
If there exists m(3mn) such that G contains exactly one cycle of length l for every l∈{3,4,…,n}-{m} and contains no cycle of length of m,then G is called almost uniquely pancyclic graph.
若存在m(3(?)m<n)使对每个l∈{3,4,…,n} -{m},G恰有一个长为l的圈且不含长为m的圈,则称G是几乎唯一泛圈图,用(?)k表示具有n+k条边和恰有1/2(k+1)(k+2)个圈的简单H图的集合,用(?)_k~*表示具有n+k条边恰有2~k+k个圈的简单外可平面H图的集合,本文确定了(?)_k和(?)_k~*中所有几乎唯一泛圈图,并证明这些图都是简单MCD图,本文还构造了50个含有同胚于K_4的子图的几乎唯一泛圈图,并提出了若干问题和猜想。
2.
If there exists m(3(?)m<n) such that G contains exactly one cycle of length l for every l∈{3,4,…n}-{m} and contains no cycle of length of m; then G is called almost uniquely pancyclic graph.
若存在m(3(?)m
补充资料:几乎
①将近于;接近于:今天到会的~有五千人。②差点儿 ②:不是你提醒我,我~忘了ㄧ两条腿一软,~摔倒。也说几几乎。
说明:补充资料仅用于学习参考,请勿用于其它任何用途。
参考词条