Graphs isomorphic to their maximum matching graphs
文献类型：期刊论文
| 作者 | Liu, Yan1; Yan, Gui Ying2
|
| 刊名 | ACTA MATHEMATICA SINICA-ENGLISH SERIES
 |
| 出版日期 | 2009-09-01 |
| 卷号 | 25期号:9页码:1507-1516 |
| 关键词 | isomorphic maximum matching graph bipartite graph factor-critical graph |
| ISSN号 | 1439-8516 |
| DOI | 10.1007/s10114-009-7676-8 |
| 英文摘要 | The maximum matching graph a"(3)(G) of a graph G is a simple graph whose vertices are the maximum matchings of G and where two maximum matchings are adjacent in a"(3)(G) if they differ by exactly one edge. In this paper, we prove that if a graph is isomorphic to its maximum matching graph, then every block of the graph is an odd cycle. |
| 资助项目 | National Natural Science of Foundation of China[10531070] ; National Natural Science of Foundation of China[10721101] ; National Natural Science of Foundation of China[KJCX-YW-S7] |
| WOS研究方向 | Mathematics |
| 语种 | 英语 |
| WOS记录号 | WOS:000269878500008 |
| 出版者 | SPRINGER HEIDELBERG |
| 源URL | [http://ir.amss.ac.cn/handle/2S8OKBNM/8350]  |
| 专题 | 应用数学研究所 |
| 通讯作者 | Liu, Yan |
| 作者单位 | 1.S China Normal Univ, Sch Math, Guangzhou 510631, Guangdong, Peoples R China 2.Chinese Acad Sci, Acad Math & Syst Sci, Beijing 100190, Peoples R China |
| 推荐引用方式 GB/T 7714 | Liu, Yan,Yan, Gui Ying. Graphs isomorphic to their maximum matching graphs[J]. ACTA MATHEMATICA SINICA-ENGLISH SERIES,2009,25(9):1507-1516. |
| APA | Liu, Yan,&Yan, Gui Ying.(2009).Graphs isomorphic to their maximum matching graphs.ACTA MATHEMATICA SINICA-ENGLISH SERIES,25(9),1507-1516. |
| MLA | Liu, Yan,et al."Graphs isomorphic to their maximum matching graphs".ACTA MATHEMATICA SINICA-ENGLISH SERIES 25.9(2009):1507-1516. |
入库方式： OAI收割
来源：数学与系统科学研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。