共查询到20条相似文献,搜索用时 93 毫秒
1.
2.
《数学的实践与认识》2013,(22)
提出了幺半环上模糊有限状态自动机的各种乘积以及覆盖的定义,并得到了一些性质.证明了直积、级联积、圈积三种乘积以及和之间的覆盖关系,得到了乘积自动机、和自动机覆盖关系的一些代数性质. 相似文献
3.
马刚 《数学的实践与认识》2012,42(9):207-213
研究了一些Mycielski图的点可区别均匀全染色(VDETC),利用构造法给出了路、圈、星和扇的Mycielski图的点可区别均匀全色数,验证了它们满足点可区别均匀全染色猜想(VDETCC). 相似文献
4.
1977年,H.Bodendiek等人提出猜想:一个圈任意加上两个不相邻顶点的边所得的图是愉快图。1980年C.Delorme等人证明了这个猜想,后来,又有一些人不止一次地给出了它的不同方法的证明。本文在变更原猜想条件的情况下,证明了以下定理。 相似文献
5.
6.
7.
8.
图的因子和因子分解的若干进展 总被引:7,自引:0,他引:7
本文综述了图的的因子和因子分解近年来的一些新结果。主要有图的因子与各种参数之间的关系,图有某种因子的一些充分必要条件,特别是图有k-因子的一些充分条件以及关于图的因子分解和正交因子分解的一些新结果。文中提出了一些新的问题和猜想。 相似文献
9.
10.
Fan和Raspaud 1994年提出如下猜想:任一无桥3正则图必有三个交为空集的完美匹配.本文证明了如下结果:若G是一个圈4-边连通的无桥3正则图,且存在G的一个完美匹配M1使得G—M1恰为4个奇圈的不交并,则存在图G的两个完美匹配M2和M3使得M1∩M2∩M3=Φ。 相似文献
11.
Mostafa Blidia 《Discrete Mathematics》2006,306(16):1840-1845
A paired-dominating set of a graph G is a dominating set of vertices whose induced subgraph has a perfect matching, and a double dominating set is a dominating set that dominates every vertex of G at least twice. We show that for trees, the paired-domination number is less than or equal to the double domination number, solving a conjecture of Chellali and Haynes. Then we characterize the trees having equal paired and double domination numbers. 相似文献
12.
13.
14.
A proof of Sethares' conjecture 总被引:1,自引:0,他引:1
YAO GuowuSchool of Mathematical Sciences Peking University Beijing China 《中国科学A辑(英文版)》2004,47(2):236-244
Let (?)(z) be holomorphic in the unit disk △ and meromorphic on △. Suppose / is a Teichmuller mapping with complex dilatation In 1968, Sethares conjectured that f is extremal if and only if either (i)(?) has a double pole or (ii)(?) has no pole of order exceeding two on (?)△. The "if" part of the conjecture had been solved by himself. We will give the affirmative answer to the "only if" part of the conjecture. In addition, a more general criterion for extremality of quasiconformal mappings is constructed in this paper, which generalizes the "if" part of Sethares' conjecture and improves the result by Reich and Shapiro in 1990. 相似文献
15.
V. N. Karpushkin 《Functional Analysis and Its Applications》2011,45(2):154-156
The first example of a phase is presented for which Arhold’s conjecture on the validity of uniform estimates for oscillatory
integrals with maximal singularity index is true, while his conjecture on the semicontinuity of the singularity index is false.
A rough upper bound for the Milnor number such that the latter conjecture fails is obtained. The corresponding counterexample
is simpler than Varchenko’s well-known counterexample to Arnold’s conjecture on the semicontinuity of the singularity index.
This gives hope to decrease codimension and the Milnor number for which the conjecture on the semicontinuity of the singularity
index fails. 相似文献
16.
关于Whitney和Tutte猜想 总被引:5,自引:0,他引:5
whitney和Tutte把平面四色问题化为只与圈上的4染色集有关的问题来研究,从而探讨四色问题的理论证明;提出了一个蕴含着四色定理的猜想。本文研究开集的组合不变性,从而证明Whitney和Tutte的猜想不成立。 相似文献
17.
Oswin Aichholzer 《Journal of Combinatorial Theory, Series A》2008,115(2):254-278
We pose a monotonicity conjecture on the number of pseudo-triangulations of any planar point set, and check it on two prominent families of point sets, namely the so-called double circle and double chain. The latter has asymptotically n12nΘ(1) pointed pseudo-triangulations, which lies significantly above the maximum number of triangulations in a planar point set known so far. 相似文献
18.
In 1971, Fulkerson made a conjecture that every bridgeless cubic graph contains a family of six perfect matchings such that each edge belongs to exactly two of them; equivalently, such that no three of the matchings have an edge in common. In 1994, Fan and Raspaud proposed a weaker conjecture which requires only three perfect matchings with no edge in common. In this paper we discuss these and other related conjectures and make a step towards Fulkerson’s conjecture by proving the following result: Every bridgeless cubic graph which has a 2-factor with at most two odd circuits contains three perfect matchings with no edge in common. 相似文献
19.
Moshe Rosenfeld 《Aequationes Mathematicae》1989,38(1):50-55
Summary A variety of examples of 4-connected 4-regular graphs with no pair of disjoint Hamiltonian circuits were constructed in response to Nash-Williams conjecture that every 4-connected 4-regular graph is Hamiltonian and also admits a pair of edge-disjoint Hamiltonian circuits. Nash-Williams's problem is especially interesting for planar graphs since 4-connected planar graphs are Hamiltonian. Examples of 4-connected 4-regular planar graphs in which every pair of Hamiltonian circuits have edges in common are included in the above mentioned examples.B. Grünbaum asked whether 5-connected planar graphs always admit a pair of disjoint Hamiltonian circuits. In this paper we introduce a technique that enables us to construct infinitely many examples of 5-connected planar graphs, 5-regular and non regular, in which every pair of Hamiltonian circuits have edges in common. 相似文献
20.
Arthur Hoffmann-Ostenhof 《Discrete Mathematics》2007,307(22):2723-2733
The bipartizing matching conjecture (BMC) is a rather new approach to the nowhere zero 5-flow conjecture (NZ5FC) and the cycle double cover conjecture (CDCC). We show that the BMC is wrong in its actual version by constructing a counterexample. The construction arises from the investigation of the problem to cover the vertices of a graph by two induced Eulerian subgraphs. Finally, we state a modified version of the BMC which has the same impact on the NZ5FC and CDCC. 相似文献