共查询到20条相似文献,搜索用时 62 毫秒
1.
《数学的实践与认识》2015,(23)
称图G是k-偶匹配可扩的,是指G的每一个基数不大于k(1≤k≤(|V(G)|-2)/2)的偶匹配M都可以扩充为G的一个完美匹配.根据循环图的性质研究了图C_(2n)(1,(2n+1)/3)的匹配可扩性,证明了对于任意的n(n≥4),C_(2n)(1,(2n+1)/3)是3-偶匹配可扩的. 相似文献
2.
郑茂林 《应用数学与计算数学学报》1987,(2)
ξ1.引言本文所考虑的图均指无自环、无重边、无向有限的连通图,没有特别指明的术语见[1].以V(G)、E(G)分别表示图C的顶点集与边集. 设M是图G的一个支撑子图.若M的每个顶点的度是0或者1,则称M是G的一个匹配,若M是G的匹配中边数最多的一个,则称M是G的一个最大匹配;若M是G的匹配,且M中无0度顶点,则称M是G的一个完美匹配. 图G称为n连通的,若对G的任意两个不同的顶点x,y,G中存在n条以x,y为端点 相似文献
3.
小直径图的导出匹配覆盖 总被引:1,自引:1,他引:0
设G是一个图,而M1,M2,…,Mk是G的k个导出匹配.称{M1,M2,…,Mk}是图G的一个k-导出匹配覆盖,若V(M1)∪V(M2)∪…∪V(Mk)=V(G).k-导出匹配覆盖问题是指对任一个给定的图G是否存在一个k-导出匹配覆盖.这篇文章证明了:直径为6的图的2-导出匹配覆盖问题和直径为2的图的3-导出匹配覆盖问题是NP-完备的,直径为2的图的2-导出匹配覆盖问题多项式可解. 相似文献
4.
本文证明了:设G是n阶、k(≥3)连通无爪图,且不含同构于B的导出子图,若存在点v_0∈V(G),使d(v_0)≥n-2k+4,则G是Hamilton连通的. 相似文献
5.
6.
设G是一个图,n,k和d是三个非负整数,满足n+2k+d≤|V(G)|-2,|V(G)|和n+d有相同的奇偶性.如果删去G中任意n个点后所得的图有k-匹配,并且任一k-匹配都可以扩充为一个亏d-匹配,那么称G是一个(n,k,d)-图.Liu和Yu[1]首先引入了(n,k,d)-图的概念,并且给出了(n,k,d)-图的一个刻划和若干性质. (0,k,1)-图也称为几乎k-可扩图.在本文中,作者改进了(n,k,d)-图的刻划,并给出了几乎k-可扩图和几乎k-可扩二部图的刻划,进而研究了几乎k-可扩图与n-因子临界图之间的关系. 相似文献
7.
给定一个简单图G和正整数κ,具有完美匹配的图G的κ-导出匹配划分是对顶点集V(C)的一个κ-划分(V1,V2,...,Vκ),其中对每一个i(1≤i≤κ),由Vi导出的G的子图G[Vi]是1-正则的.κ-导出匹配划分问题是指对给定的图G,判定G是否存在一个κ-导出匹配划分.令M1,M2…,Mκ为图G的κ个导出匹配,如果V(M1)UV(M2)∪...∪V(Mκ)=V(G),则我们称{M1,M2,...,Mκ}是G的κ-导出匹配覆盖.κ-导出匹配覆盖问题是指对给定的图G,判定G是否存在κ-导出匹配覆盖.本文给出了Yang,Yuan和Dong所提出问题的解,证明了直径为5的图的导出匹配2一划分问题和导出匹配2-覆盖问题都是NP-完全的. 相似文献
8.
9.
10.
11.
《运筹学学报》2014,(3)
正August 10-14,2015Beijin,China The International Congress on Industrial and Applied Mathematics(ICIAM)is the premier international congress in the field of applied mathematics held every four years under the auspices of the International Council for Industrial and Applied Mathematics.From August 10 to 14,2015,mathematicians,scientists 相似文献
12.
13.
《数学学报(英文版)》2014,(10)
<正>Submission Authors must use LaTeX for typewriting,and visit our website www.actamath.com to submit your paper.Our address is Editorial Office of Acta Mathematica Sinica,Academy of Mathematics and Systems Science,Chinese Academy of Sciences,Beijing 100190,P.R.China. 相似文献
14.
ZhouSongping YaoKui SuWeiyi 《分析论及其应用》2004,20(4):332-341
The present paper investigates the fractal structure of fractional integrals of Weierstrass functions. The ezact box dimension for such functions many important cases is established. We need to point out that, although the result itself achieved in the present paper is interesting, the new technique and method should be emphasized. These novel ideas might be useful to establish the box dimension or Hausdorff dimension (especially for the lower bounds) for more general groups of functions. 相似文献
15.
《应用数学学报(英文版)》2014,(4)
正1 Aims and Scope Acta Mathematicae Applicatae Sinica(English Series)is a quarterly journal established by the Chinese Mathematical Society.The journal publishes high quality research papers from all branches of applied mathematics,particularly welcomes those from partial differential equations,computational mathematics,applied probability,mathematical finance,statistics,dynamical systems,optimization and management science. 相似文献
16.
17.
We characterize congruence lattices of standard QBCC-algebras and their connection with the congruence lattices of congruence
kernels.
Work on the paper was supported by Council of Czech Government No J14/98:153100011. 相似文献
18.
A new class of sets in ideal topological spaces is introduced and using these sets, a decomposition of continuity is given.
相似文献
19.
We obtain (a) necessary and sufficient conditions and (b) sufficient conditions for a compact (countably compact) set to be closed in products (sequential products) and subspaces (sequential subspaces) of normal spaces. As a consequence of these, sufficient conditions are obtained for (i) the closedness of arbitrary (countable) union of closed sets and (ii) the equality of the union of the closures and the closure of the union of arbitrary (countable) families of sets in these spaces. It is also shown that these results do not hold for quotients of even T
4,-spaces. 相似文献
20.
A. Barkhudaryan R. Barkhudaryan A. Poghosyan 《分析论及其应用》2007,23(3):228-242
The current paper considers the problem of recovering a function using a limited number of its Fourier coefficients. Specifically, a method based on Bernoulli-like polynomials suggested and developed by Krylov, Lanczos, Gottlieb and Eckhoff is examined. Asymptotic behavior of approximate calculation of the so-called "jumps" is studied and asymptotic L2 constants of the rate of convergence of the method are computed. 相似文献