| 最大2-正则诱导子图的长度 |
| |
| 引用本文： | 束金龙. 最大2-正则诱导子图的长度[J]. 运筹学学报, 2003, 7(4): 50-56 |
| |
| 作者姓名： | 束金龙 |
| |
| 作者单位： | 华东师范大学数学系,上海,200062 |
| |
| 基金项目： | The research was supported by NNSF of China(19971027, 10271048)，Shanghai Priority Academic Discipline. The research was done while the author was visiting LRI. |
| |
| 摘 要： | 设G是2-连通图，c(G)是图G的最长诱导圈的长度，c′(G)是图G的最长诱导2-正则子图的长度。本文我们用图的特征值给出了c(G)和c′(G)的几个上界。
|
| 关 键 词： | 2-正则诱导子图 特征值 诱导圈 上界 无向图 |
The Length of the Largest Induced 2-Regular Subgraph in Graphs |
| |
| JINLONG SHU. The Length of the Largest Induced 2-Regular Subgraph in Graphs[J]. OR Transactions, 2003, 7(4): 50-56 |
| |
| Authors: | JINLONG SHU |
| |
| Abstract: | Let G be a 2-connected graph. Let us define c(G) the length of the longest induced cycle in G and c'(G) the maximal order of an induced 2-regular subgraph of G. In this paper, we present several upper bounds on c(G) and c'(G) of graphs in terms of eigenvalues. |
| |
| Keywords: | OR eigenvalues induced cycle regular graph induced 2-regular subgraph |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
