收藏本站
收藏 | 手机打开
二维码
手机客户端打开本文

图的导出匹配可扩性

王勤  
【摘要】:ABSTRACT GraPhs considered in this thesis are finite, undirected and ede. ROughly spallng, the prOPerties we are concerned in this theSis are mainly as follow: 1. The degree sum conditions Of induced matching extendabe graPhs. 2. Mtwal induced matching tmextendable graPhs. The orgedation of the thess is as follow' In the first chaPter, we list some notatiOnS and introduce some toPics about matching theory and the induced rnatching extendable gmphs. In the second chaPter, the degree suxn conditions of IM-extendable graPhs, IM-ex- tendable claw-free graphs and IM-extendab1e bipatite graPhs are presented. In the third chapter, the mbomal induced matching unextendable graphs are characterized. DrW Sum Conditions of 1nduced Matcbing Extendabe Graphs MgE(G) is a matching of G, if v(e) n v(f) = o for every two dis- tinct edges e, f e M. A matching is said to be the mchum .matching if it contains the mbomum number of edges. If a matching covers all the vertices of G, we call the matching a perfect matching of G. A matching M of G is in- duced, if E (V(M) ) = M. A graph G is induced matching extendabe (short- ly, IM-extendable), if every induced matching of G is included in a peffect matching of G. Graph G is nextendable if G has a matching of sise n and ev- ery such matching extends to (i. e. is a subset of ) a pedect matching in G. A graPh G is bicritical if G -- u -- v has a perfect matching for evmp chOce of two -. ponts u, v in G. Since PltnnIner[ 14 ] raised the problem of n-extendablity, -- 1 -- znany resultS in the Wct M[5' 13' 14, 15 ]. Cameron gave the conCopt of induced matching in [2]. Ane ftmdamental resultS on induced matChing can be found in [2, 4, 6]. In 1998, YUan[22] deW the indUced tnaching ex- tendable graphs, shothe, IM-extendable graPhs, and charaCterized them Part- ly. Plummer[12] has H the following reSul which invOlves degree stnns of SetS of t indePendent poins, for t3. LeUUna 1 - 1 SUPpee G is a k-connected graP with p points where p is even and n is any inteqer sW 1n p/2. SuPpe further that there W a t, 1tk -- 2n + 2 such that fOr all indePendent setS I = 1 wl, '..' t w,l having l II = t, it follow that .gld(wi)t((p --2)/2+ n) + 1. Then if (a) n = 1, G is bicritical (and hence 1 -- extendabl) and if (b) n2, G is n-extendable. The following result is a coroary of LerIuna 1. 1 (namely, the case when t = 2). Dere1lary 1 .2 Let G be a graph with p ponts, p even, and let n be an integer, 1n p/2. SuPPOSe that for all pairS of nonadacent pontS u and v in G, d(u) + d(v)7p +2n -- 1. Then if (a) n == 1, G is bicritical (and hence l -- extendabe) and if (b) n2, G is n-extendable. Motivated by corOllary 1. 2, we obtain the degree sum conditions of in- duced matching extendable graphs. Tbeorem 1.3 Let G be a graph with 2n vertices. If for each pair of nonadjacent vertices u and v in G, we have d(u ) + d (v)2rty1 -- 1, then G is IMextendable. And this is best poSSble. Theorem 1.4 SuPpoSe that G is a claw-free gr8Ph with 2n vertices. If fOr each pair of nonadjacent vertices u and v in G, d (u ) + d (v)2n + 3, then G is IM-extendable' And this is best mpible. -- 2 -- Theorem 1 .5 Clawfree mforal planar graPh is IMextendable. In the clawfree conditiOnS, we characterize all the graPhs with twUIn degree sum 2n + 2 and 2n + 1 which are IMunextendable. Theorem 1. 6 Let G be a biPartie graPh with biPhotion (A, B ), where IA I = lBI = n - If for each pair Of nonadacent venices u and v in G, we have d (u ) + d (v )rop1, then G is IM~extendabe. Maxhoal 1nduced Matctw U--dable Grahs A graph G is med IM-tmextendable if G is no induced matChing ex- tendabe and, for every twO nonadacent vertices x and y, G + cy is induced matching extendable. In chaPter 3, we charaCteri2e the mhanal IM-unextend- able graPhs. Theorem 2. 1 (Tutte's theorem) A graPh G has a perfect matching if and ouly if for every S= V(G), o(G -- S) I S I. Here, o(H) is the num- ber of edd componentS of H.


知网文化
【相似文献】
中国期刊全文数据库 前20条
1 蒋文斌,周曼丽,彭复员,许毅平;Novel block-matching algorithms by subsampling both search candidates and pixels[J];Journal of Systems Engineering and Electronics;2005年03期
2 易志坚;赵朝华;杨庆国;彭凯;黄宗明;;General forms of elastic-plastic matching equations for mode-Ⅲ cracks near crack line[J];Applied Mathematics and Mechanics(English Edition);2009年05期
3 ;General Induced Matching Extendability of G~3[J];数学研究与评论;2010年03期
4 LICHENG GE;YUPING CHEN;HAOWEI JIANG;GUANGZHEN LI;BING ZHU;YI’AN LIU;XIANFENG CHEN;;Broadband quasi-phase matching in a MgO:PPLN thin film[J];Photonics Research;2018年10期
5 Wenhao FAN;Yuanan LIU;Bihua TANG;;Toward high efficiency for content-based multiattribute event matching via hybrid methods[J];Science China(Information Sciences);2016年02期
6 Paul Morrison;Ju Jia Zou;;Inexact graph matching using a hierarchy of matching processes[J];Computational Visual Media;2015年04期
7 Yan Zhao;Yuwei Zhai;Eric Dubois;Shigang Wang;;Image matching algorithm based on SIFT using color and exposure information[J];Journal of Systems Engineering and Electronics;2016年03期
8 Li Dapeng;;A novel method for multi-angle SAR image matching[J];Chinese Journal of Aeronautics;2015年01期
9 李宗艳;宋丽梅;习江涛;郭庆华;朱新军;陈明磊;;A stereo matching algorithm based on SIFT feature and homography matrix[J];Optoelectronics Letters;2015年05期
10 Yuan Tian;Yin Yang;Xiaohu Guo;Balakrishnan Prabhakaran;;Stable haptic interaction based on adaptive hierarchical shape matching[J];Computational Visual Media;2015年03期
11 ZHANG Dong-sheng;YANG Jian-jun;;Program Optimization of Parametric Matching Design of Central Region Inflector in Cyclotron[J];Annual Report of China Institute of Atomic Energy;2016年00期
12 洛佩;;Assessment of the accuracy of real-time continuous glucose monitoring system and its correlated factors[J];China Medical Abstracts(Internal Medicine);2014年01期
13 翟东海;CUI Jing-jing;NIE Hong-yu;DU Jia;;New event detection based on sorted subtopic matching algorithm[J];Journal of Chongqing University(English Edition);2013年04期
14 ;Displacement residual based DDM matching algorithm[J];Science China(Information Sciences);2012年09期
15 霍炬;杨宁;曹茂永;杨明;;A reliable algorithm for image matching based on SIFT[J];Journal of Harbin Institute of Technology;2012年04期
16 王俊丽;丁志军;侯玉兵;;Automatic Web services composition algorithm based on optimal matching[J];Journal of Central South University of Technology;2011年04期
17 ;A stochastic policy search model for matching behavior[J];Science China(Information Sciences);2011年07期
18 ;A hybrid matching method for geospatial services in a composition-oriented environment[J];Science China(Technological Sciences);2010年S1期
19 金伟其;陈艳;王岭雪);刘斌;刘崇亮;沈亚中;张桂清;;Video Image Block-matching Motion Estimation Algorithm Based on Two-step Search[J];Journal of Measurement Science and Instrumentation;2010年03期
20 Ja Choon Koo;Hyouk Ryeol Choi;;Improved block matching approach to fast disparity estimation[J];Journal of Systems Engineering and Electronics;2009年06期
中国重要会议论文全文数据库 前10条
1 Tianci Ao;Xiaodong Liu;Yan Ren;Rui Luo;Jie Xi;;An approach to scene matching algorithm for UAV autonomous navigation[A];第30届中国控制与决策会议论文集(1)[C];2018年
2 Gong Zhe;Leng Xuefei;Liu Yang;;A fast image matching method based on high-dimensional combined features[A];第36届中国控制会议论文集(D)[C];2017年
3 ;Edge Direction Dispersion and Its Application in Automatic Suitable-matching Area Selection[A];Proceedings of the 2011 Chinese Control and Decision Conference(CCDC)[C];2011年
4 ;A real time displacement estimation algorithm for ultrasound elastography[A];2011年全国压电和声波理论及器件应用研讨会报告程序册及摘要集[C];2011年
5 Yan Zheng;Hong Li;;Interactions Between Introns and Corresponding mRNA Sequences In 5'UTR Region of Complete Genome Sequences in D.melanogaster[A];第五届全国生物信息学与系统生物学学术大会论文集[C];2012年
6 Zhanhai Yu;Ke Wang;Rifeng Li;;The inter-frame Feature Matching and Tracking of Binocular Vision Based on the ORB-PyrLK algorithm[A];第36届中国控制会议论文集(E)[C];2017年
7 Yuxia Sun;Cheng Liu;Hongkun Qiu;;The Research on Patterns and UCT Algorithm in NoGo Game[A];第25届中国控制与决策会议论文集[C];2013年
8 ;A DISCUSSION ON HOUSE COLOR MATCHING[A];2006年中国机械工程学会年会暨中国工程院机械与运载工程学部首届年会论文集[C];2006年
9 Xutang Tao;Zeliang Gao;Youxuan Sun;Xiangxin Tian;Qian Wu;;New developments in nonlinear optical crystals of molybdate and tungstate[A];中国化学会第九届全国无机化学学术会议论文集——C固体无机化学[C];2015年
10 ;Model Matching Control of Multiple-Input-Delay Systems[A];2009中国控制与决策会议论文集(1)[C];2009年
中国博士学位论文全文数据库 前6条
1 刘岩;关于图的最大匹配问题的若干结果[D];郑州大学;2000年
2 冯启龙;Packing和Matching问题的参数化算法研究[D];中南大学;2010年
3 Akram Ismail Mohamed Omara;[D];复旦大学;2013年
4 Noman Saeed(诺曼);用于教育的有条件现金转移支付在巴基斯坦的社会经济效应—来自信德省的经验证据[D];吉林大学;2016年
5 陈志宏;图像密写中若干关键技术的研究[D];天津大学;2008年
6 Khalil Ahmed Saleh Al-mekhlafi;[D];大连理工大学;2011年
中国硕士学位论文全文数据库 前10条
1 王勤;图的导出匹配可扩性[D];郑州大学;2000年
2 阿尼斯(Anees Ahmed);使用静态方法对学生java程序评分[D];哈尔滨工业大学;2018年
3 Pedro Rodríguez Pérez;利用后触碰速度匹配的柔性控制捕获自由浮动目标[D];武汉大学;2018年
4 毋伟;[D];郑州大学;2003年
5 宁丹;Matching和packing问题的参数算法研究[D];中南大学;2007年
6 Rojanakat Payomrat;基于神经网络的双目视差估计[D];哈尔滨工程大学;2010年
7 鲁晓旭;关于图的导出匹配问题的若干结果[D];郑州大学;2004年
8 Alimbekov Abay;[D];南京理工大学;2017年
9 徐志敏;基于matching-CNN的行人再识别[D];西安电子科技大学;2015年
10 王洪波;情绪心理在艺术设计色彩中的应用研究[D];齐齐哈尔大学;2013年
中国重要报纸全文数据库 前2条
1 厦门日报社全媒体记者 刘艳 通讯员 吴权林;国资国企登场 优质项目落地 State—owned Enterprises Ink Projects through Matching Meeting[N];厦门日报;2018年
2 湖南 双龙一剑;让重复文件无处可逃[N];电脑报;2003年
 快捷付款方式  订购知网充值卡  订购热线  帮助中心
  • 400-819-9993
  • 010-62982499
  • 010-62783978